Q. A page-replacement algorithm should minimize the number of page faults. We can achieve this minimization by distribut

[answerhappygod]

Q.
A page-replacement algorithm should minimize the number of pagefaults. We can achieve this minimization by
distributing heavily used pages evenly over all of memory,rather than having them compete for a small number
of page frames. We can associate with each page frame a counterof the number of pages associated with that
frame. Then, to replace a page, we can search for the page framewith the smallest counter.
Define a page-replacement algorithm using this basic idea.Specifically address these problems:
a. What is the initial value of the counters?
b. When are counters increased?c. When are countersdecreased?
d. How is the page to be replaced selected?