Assume a page reference string for a process with m frames(initially
all empty). The page reference string has lenth p with n distinct
page numbers occurring in it. For any page-replacement algorithm,
(1)What is a lower bound on the number of page faults?
(2)What is a upper bound on the number of page faults?
答案是
(1)n
(2)p
有人可以解釋一下為什麼嗎?
鋼溫!!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 223.139.236.106