Three new combination algorithms with the minimal change property

Clement W. H. Lam, Leonard H. Soicher · Communications of the ACM · 1982

Although the page size used in a storage hierarchy is typically fixed when the subsystem is designed, it is possible to simulate a variable size page by fetching a group of contiguous pages in the address space whenever one of them is referenced [3, 9, 12, 14].Perhaps the number of pages included in a group could be varied dynamically to ensure that the value of the fraction halfreferenced is kept within a desirable range.It may therefore be possible that the fraction halfreferenced could be dynamically measured during the operation of a storge hierarchy, and used as a feedback parameter to control the extent to which future storage references are predicted when a page fault occurs by transferring a variable number of pages, and also to control the residence periods of those pages by adjusting the number of first level storage page frames allocated to each executing process.

Read the paper · More papers on PaperTik