| homework 7 Version 0 |
|
| š¤ Author: by 1529034972qqcom 2017-01-04 13:59:17 |
9.13 A page-replacement algorithm should minimize the number of pageĀ faults. 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. Wāe can associate with each page frameĀ a counter of the number of pages associated with that frame. Then,Ā to replace a page, we can search for the page frame with the smallestĀ counter.
a.Ā Define a page-replacement algorithm using this basic idea. Specifically address these problems:
> Computer and Education