Principles of Optimal Page Replacement
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
The working set model for program behavior
Communications of the ACM
Operating Systems Theory
A dynamic clustering strategy in a demand paging environment
ANSS '76 Proceedings of the 4th symposium on Simulation of computer systems
A measure for program locality in demand paging
ACM '75 Proceedings of the 1975 annual conference
Program behavior and virtual memory management in time-shared computer systems.
Program behavior and virtual memory management in time-shared computer systems.
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
ACM '77 Proceedings of the 1977 annual conference
| Hi-index | 0.00 |
An algorithm is presented which dynamically clusters pages of a problem program based on its post program behavior (i.e. reference string patterns) in a demand paged virtual memory environment. The objective of this algorithm is to minimize the number of page faults during execution, while at the same time use memory page frames efficiently. Dynamic clusters of “time and reference” related pages are built during a program's execution time. The Modified Locality Matrix Model is used to determine inherent program locality and to predict independent dynamic program behavior, separating instruction from data references. Furthermore, strength coefficients between weakly or loosely coupled clusters are used to refine the cluster population, identify cluster transitions, as well as indicate the behavior of the cluster formations.