Question: Consider a disk queue with requests for I/O to blocks on cylinders for a disk with 51 cylinders (0-50). 11, 1, 36, 16, 34, 9,
Consider a disk queue with requests for I/O to blocks on cylinders for a disk with 51 cylinders (0-50). 11, 1, 36, 16, 34, 9, 12 in that order. Assume the head is at location 11 and moving up, when needed.
What is the total seek distance traveled to satisfy all the requests.
| Considering look -elevator- scheduling, the total number of head movements is? |
| Considering SSTF (shortest seek time first) scheduling, the total number of head movements is? |
Considering C-Scan scheduling, the total number of head movements is?
Considering FCFS (first come first served) scheduling, the total number of head movements is?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
