阿摩線上測驗 登入

申論題資訊

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

題組內容

5. A disk has 24000 cylinders, cach with 16 tracks of 512 blucks. A seck takes I ns per cylinder moved. II' no attempt is made to put the hioks of a lile close to each otber. two blocks that are logically consecutive (i.c.. follow one another in the file) will require aun averragc seck. which tikes 6 mis. If. however. the operating system makes un attempt to cluster selated blocks. the meun interblock distancc c:ul be reduced lo 2 cylinders and the seek time seduced to 200 jas. Assuming that the rotational laleney is 3 mi and the transfer time is 10 ps per block, answer the following questions.

申論題內容

(a)How long does it take to sead a 300 block randomly placed file?