A disk head is currently at cylinder 50. The pending requests, in the order they arrived, are for cylinders: 4, 34, 10, 7, 19, 73, 2, 15, 6, 20. Using the Shortest-Seek-Time-First (SSTF) disk scheduling policy, and given that it takes 1 ms to move the head between two adjacent cylinders, what is the total time needed to service all the requests?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. (A) 119 ms
More System Software and Operating System questions
- Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorith…
- What is called journaling in a Linux operating system?
- In a file allocation system, the following allocation schemes are used: (A) Contiguous allocation, (B) Indexed allocation, (C) Linked alloc…
- Suppose a Linux file system has a block size of 2K bytes, a disk address is 32 bits, and an i-node contains the disk addresses of the first…
- Consider a disk system having 60 cylinders. Disk requests are received by the disk drive for cylinders 10, 22, 20, 2, 40, 6, and 38, in tha…
- A disk queue has requests for I/O on cylinders 98, 183, 37, 122, 14, 124, 65, 67, with the disk head currently at cylinder 53. Using the sh…