[理工] [ OS ] 98 中山資工
4.Assume a page reference string for a process with m frames,the page reference
string has length p with n distinct page numbers occurring in it.
for any page –replacement algorithm
(a) what is lower bound on the number of page faults?
(b) what is upper bound on the number of page faults?
我自己寫的答案是
(a)1, 從頭到尾只reference同一個page
(b)p, 全部都page fault
而看到手邊的答案是
(a)n, 都只有load進來的那次
(b)p, 全部都page fault
請問我這樣想是有問題嗎? 請指教
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 123.204.2.14
→
03/25 10:23, , 1F
03/25 10:23, 1F
推
03/25 10:25, , 2F
03/25 10:25, 2F
推
03/25 10:25, , 3F
03/25 10:25, 3F
→
03/25 10:41, , 4F
03/25 10:41, 4F
推
03/25 11:21, , 5F
03/25 11:21, 5F