以下截至106清大計系第5題
A student in a compiler design course proposes to the professor a project of
writing a compiler that will produce a list of page references that can be
used to implement the optimal page replacement algorithm. Is this possible ?
Why or why not ? Is there anything that could be done to improve paging
effiiency at run time ?
我的疑問:
之前我是寫opt置換法因為要得知未來page access順序才能得以實施,所以這題答案
impossible
但是過幾天再複習的時候我又多了一個想法:
這個學生不是在上compiler design的"課程"嗎?既然是課程,教授可以給他一串access順序
(好比考試的時候給你一組access順序問OPT法的page fault次數那樣),這樣不就行得通了?
這問題困擾我幾個小時了 麻煩大神說明一下我的盲點QQ