Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently servicing request at cylinder 60 and the previous request was at cylinder 80. The queue has a pending request at cylinder 58, 26, 54, 68, 49, 61, 63, 69 ,24, 14 and 90. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests by using the Shortest Seek Time First algorithm.
Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently servicing request at cylinder 60 and the previous request was at cylinder 80. The queue has a pending request at cylinder 58, 26, 54, 68, 49, 61, 63, 69 ,24, 14 and 90. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests by using the Shortest Seek Time First algorithm.
Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter20: Queuing Theory
Section20.10: Exponential Queues In Series And Open Queuing Networks
Problem 10P
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole