[理工] OS-file system

看板Grad-ProbAsk作者 (冀憶)時間16年前 (2009/06/08 00:16), 編輯推噓0(000)
留言0則, 0人參與, 最新討論串1/2 (看更多)
以下為題目 A disk has 4000 cylinders, each with 8 tracks of 512 blocks. A seek takes 1 msec per cylinder moved. If no attempt is made to put the blocks of a file close to each other, two blocks that are logically consecutive (i.e., follow one another in the file) will require an average seek, which takes 5 msec. If, however, the operating system makes an attempt to cluster related blocks , the mean interblock distance can be reduced to 2 cylinders and the seek time reduced to 100 microsec. How long does it take to read a 100 block file in both cases, if the rotational latency is 10 msec and the transfer time is 20 microsec per block? 我看超久的還是不太懂怎麼寫 冏rz 希望有高手可以解答 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.117.194.90
文章代碼(AID): #1AA-VC-P (Grad-ProbAsk)
討論串 (同標題文章)
文章代碼(AID): #1AA-VC-P (Grad-ProbAsk)