阿摩線上測驗 登入

申論題資訊

試卷:103年 - 103 國立中山大學_碩士班招生考試_資工系(甲組):作業系統與資料結構#105840
科目:中山◆資工◆作業系統與資料結構
年份:103年
排序:0

題組內容

5. A disk has 10000 cylinders, each with 10 tracks of 512 blocks. A seek takes 1 ms 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 6 ms. 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 200 us. Assuming that the rotational latency is 3 ms and the transfer time is 10 us per block, answer the following questions.

申論題內容

(b) How long does it take to read a 200 block clustered file?