Question: 2 a . [ Points 5 ] Suppose a disk drive has 3 0 0 0 cylinders, numbered 0 . . 2 9 9 9
aPoints Suppose a disk drive has cylinders, numbered The drive is currently serving a request at cylinder It previously served a request at cylinder The queue of pending requests, in FIFO order, is: 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 diskscheduling algorithm?
bPoints Suppose a disk drive has cylinders, numbered The drive is currently serving a request at cylinder It previously served a request at cylinder The queue of pending requests, in FIFO order, is: 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 diskscheduling algorithm?
cPoints Suppose that a disk drive rotates at RPM It has an average seek time of milliseconds. If its transfer rate is Mbps determine the average time it takes for a Mbyte request to be transferred from the time the disk starts the seek? mathrm~K ; mathrmMmathrm~K
dPoints Consider a RAID level system with disks numbered as shown in the below figure. Answer the following questions i Which of the disks need to be accessed to read data block Bii Which of the disks need to be accesses to write block B
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
