[理工] [OS]-Disk

看板Grad-ProbAsk作者polomoss (小澤)時間14年前 (2010/01/19 22:43)推噓4(4推 0噓 4→)

留言8則, 6人參與討論串1/1

Consider a file currently consisting of 100 blocks. Assume that the file control block (and the index block, in the case of indexed allocation) is already in memory. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single-level)allocation strategies, if, for one block, the following conditions hold. In the contiguousallocation case, assume that there is no room to grow in the beginning, but there is room to grow in the end. Assume that the block information to be added is stored in memory. a. The block is added at the beginning. b. The block is added in the middle. c. The block is added at the end. d. The block is removed from the beginning. e. The block is removed from the middle. f. The block is removed from the end. 可以請問這一題如何解嗎?? 有答案但是看不懂..... -- ┌這篇文章讓您覺得？─────────────────────────────┐ │ │ │ 一"一 \ / >\\\< ╯ ╰ ∩ ∩ ▁ ▁ ＞＿＜ㄧㄧ+ │ │ 皿 ε □ ▽ ▇Δ ▇ ╰╯ ╯ │ │ 北七亂喔害羞莎笅爽啦哭爸ＸＤ科科 │ └──────────────────────────────────────┘ -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 122.116.14.2

→

chris750630

01/19 23:01, , 1^F

01/19 23:01, 1^F

推

assassin88

01/19 23:49, , 2^F

01/19 23:49, 2^F

→

polomoss

01/19 23:51, , 3^F

01/19 23:51, 3^F