Q4: Disk controllers map logical blocks to physical locations on the disk. Suppose that a 10MB file consisting of 1024-byte logical blocks is stored on a disk drive with the following characteristics: Rotational rate: Average seek time: Average sectors/track: Surfaces: Sector size: 12,000 RPM 8ms 1024 8 1024 bytes Suppose that a program reads all the blocks of this file sequentially, and that the time to position the head over the first block is the average seek time plus the average rotational latency. 4a) What is the best case for mapping logical blocks to disk sectors? Estimate the time required to read the file in this best-case scenario. 4b) Suppose that the logical blocks are mapped randomly to disk sectors. Estimate the time required to read the file in this scenario

Q4: Disk controllers map logical blocks to physical locations on the disk. Suppose that a 10MB file consisting of 1024-byte logical blocks is stored on a disk drive with the following characteristics: Rotational rate: Average seek time: Average sectors/track: Surfaces: Sector size: 12,000 RPM 8ms 1024 8 1024 bytes Suppose that a program reads all the blocks of this file sequentially, and that the time to position the head over the first block is the average seek time plus the average rotational latency. 4a) What is the best case for mapping logical blocks to disk sectors? Estimate the time required to read the file in this best-case scenario. 4b) Suppose that the logical blocks are mapped randomly to disk sectors. Estimate the time required to read the file in this scenario

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

USE PYTHON MULTI THREADING TO COMPLETE DO NOT USE PROCESSES ONLY COMPLETE PART 2 using MULTI THREADING 1) Basic version with two levels of threads (master and slaves) One master thread aggregates and sums the result of n slave-threads where each slavethread sums a different range of values in an array of 1000 random integers (please program to generate 1000 random integers to populate the array). ************ONLY COMPLETE THIS PART BELOW*************** 2) Advanced version with more than two levels of threadsThe master thread creates two slave-threads where each slave-thread is responsible to sum half segment of the array. Each slave thread will fork/spawn two new slave-threads where each new slave-threadsums half of the array segment received by its parent. Each slave thread will return the subtotal to its parent thread and the parent thread aggregates and returns the total to its parent thread. Start with 7 nodes thread tree, when you are comfortable, you can extend it to a full…
***Using Python A report could be produced by a program like this: Timesheet data is easy to represent in a file, where it can be used to generate a report and help the worker get paid! Given an example set of data where each row represents a day of the week and each entry on the row represents a block of time worked, like this: 0h 1.5h 3.25h 3.0h 6.0h 1.0h 5.5h 2.25h 0.75h 2.25h 3.0h 3.0h 5.75h 2.25h 0h ---------------------------------------0.00h | 0.00h5.25h | 1.50h 3.25h 0.50h10.00h | 3.00h 6.00h 1.00h8.50h | 5.50h 2.25h 0.75h8.25h | 2.25h 3.00h 3.00h8.00h | 5.75h 2.25h0.00h | 0.00h---------------------------------------Weekly Total: 40.00h Notice how in the output file all the numbers are nicely formatted as right-aligned. Hint: you will probably need to use splitting, string slicing, converting data types, and string formatting. For your assignment, create a program that uses a data file that you have created, parses the data in that file to create a calculation per row and a…
Problem DescriptionThe Tower of Hanoi ProblemTower of Hanoi is a mathematical game consisting of three pegs (P1, P2 and P3) and a stack of disks of different diameters. Disks can slide onto any peg. The game starts with all disks stacked on P1 and ends at the point where all disks stacked on P3. The game player is required to move all disks from P1 to P3 using P2 as a buffer. Three rules must be followed when playing the game(1) Only one disk may be moved at a time.(2) Each move involves taking a disk on the top of a peg and place it on the top of another peg. (3) A disk of a larger diameter should never be placed on top of a disk of a smaller diameter. The diagrams below demonstrate the starting state and goal state of the game with 5 disks.Starting state Goal stateP1 P2 P3 P1 P2 P32RequirementsIn this assignment, students are required to solve the Tower of Hanoi (with five disks) using state space search algorithms implemented in Python.Two state space search algorithms: (1) a blind…
Instructions in python: Create a compression algorithm that will compress the text "nnneennwnneeeennwwnneeeessseeenneeesswsswwwsssswww" in the parchment piece into a smaller form. The algorithm must include simple instructions of no more than 1 or 2 sentences. It is recommended that you use basic ASCII characters, as the focus here is the algorithm rather than the physical space occupied by the result. Create a copy of this spreadsheet to organize your results and calculate the compression ratios. After working for about 10 minutes, you can access a clue: 2D Map. After another 10 minutes, you can view the 2D Map with Terrain. There are many correct answers to this exercise.
With virtual memory, when a program requests memory,the memory management system does which of the following? Select one: A. It grants the request as long as there is enough physical memory to accommodate B. It looks up the address in the page table. If the address is in memory, then it grants the request. C. It looks up the address in the page table. If the address is in memory, it grants the request. If the address is stored to disk, it writes a section of memory to disk and then transfers the requested virtual memory address from disk to main memory. D. It causes a deadlock to occur.
3. I/O Management: Disk Arm Scheduling & RAIDa. It is known that a disk drive has 256 cylinders, with cylinder numbers starting from 0 and ending at 255. The position of the needle on the disk drive currently stops at 128. It is also known that the needle always “goes to the cylinder with the smaller number first”. The order of the positions visited sequentially is: 254, 64, 32, 100, 50, 70. From the 3 choices of algorithms below, which one is the best algorithm? Make each image and determine the seektime.i. SCANii. C-SCANiii. FIFO