[理工] [OS] page fault
page reference string:1,4,2,3,4,2,5,7,3,2,1,7
How many pafe faults would occur for each of the LRU and FIFO replacement
algorithm?Remember all frames are initially empty,so your first unique page
will all cost one fault each.
這是題目,只有給參考字串和replacement algorithm,並沒有給可用的頁框數,那這樣
頁框數要畫多少?
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 220.143.30.68
推
02/23 11:22, , 1F
02/23 11:22, 1F
→
02/23 11:23, , 2F
02/23 11:23, 2F
→
02/23 11:33, , 3F
02/23 11:33, 3F
討論串 (同標題文章)
完整討論串 (本文為第 1 之 4 篇)：