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
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
PostgreSQL Up And Running A Practical Guide To The Advanced Open Source Database
Authors: Regina Obe, Leo Hsu
3rd Edition
1491963417, 978-1491963418
