Question: 2 a . [ Points 5 ] Suppose a disk drive has 3 0 0 0 cylinders, numbered 0 . . 2 9 9 9

2a.[Points 5] Suppose a disk drive has 3000 cylinders, numbered 0..2999. The drive is currently serving a request at cylinder 1800. It previously served a request at cylinder 1500. The queue of pending requests, in FIFO order, is: 1500,500,1200,2300,300. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for FCFS disk-scheduling algorithm?
2b.[Points 5] Suppose a disk drive has 3000 cylinders, numbered 0..2999. The drive is currently serving a request at cylinder 1800. It previously served a request at cylinder 1500. The queue of pending requests, in FIFO order, is: 1500,500,1200,2300,300. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for SSTF disk-scheduling algorithm?
2c.[Points 5] Suppose that a disk drive rotates at 10,000 RPM. It has an average seek time of 6 milliseconds. If its transfer rate is 40 Mbps , determine the average time it takes for a 1 Mbyte request to be transferred from the time the disk starts the seek? \((1\mathrm{~K}=1024 ; 1\mathrm{M}=1024\mathrm{~K})\)
2d.[Points 5] Consider a RAID level 6 system with 4 disks (numbered 1-4) as shown in the below figure. Answer the following questions (i) Which of the disks need to be accessed to read data block B1?(ii) Which of the disks need to be accesses to write block B1?
2 a . [ Points 5 ] Suppose a disk drive has 3 0 0

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!