推 CMJ0121:應該是 always completes all requests 這句話 12/10 16:35
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