作者yesa315 (XD)
看板Grad-ProbAsk
标题[理工] [OS]-Disk scheduling
时间Thu Dec 10 12:03:05 2009
Consider a collection of disk with arbitrary arrval times.
Which one of the following disk scheduling algorithm always
completes all requests with the shortset total seek time?
(A) SSTF (B) SCAN (C)LOOK (D)none of the above
此题答案给的是D 我翻书後并没有说SSTF有最短的Total seek time
例题也可以证明SSTF不是有最短的"Total" seek time
我想问的是这题是真的D吗?
感觉LOOK的 seek time 也满短的?
请高手指导 谢谢
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 140.127.208.96
1F：推 CMJ0121:应该是 always completes all requests 这句话 12/10 16:35