Dynamic Improvement of Locality in Virtual Memory Systems
- 1 March 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-2 (1) , 54-62
- https://doi.org/10.1109/tse.1976.233801
Abstract
Replacement algorithms for virtual memory systems are typically based on temporal measures of locality, while predictive loading and program restructuring are based on spatial measures of locality. This paper suggests some techniques for dynamically improving the spatial locality of a program via predictive loading and virtual space restructuring, and presents the results of applying these techniques to actual programs. Bounds are derived for the performance of the methods.Keywords
This publication has 10 references indexed in Scilit:
- Improving locality by critical working setsCommunications of the ACM, 1974
- Empirically Derived Micromodels for Sequences of Page ExceptionsIBM Journal of Research and Development, 1973
- User program performance in virtual storage systemsIBM Systems Journal, 1973
- Distributed intelligence for user-oriented computingPublished by Association for Computing Machinery (ACM) ,1972
- Program restructuring for virtual memoryIBM Systems Journal, 1971
- Virtual MemoryACM Computing Surveys, 1970
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970
- An analysis of paging and program behaviourThe Computer Journal, 1970
- The working set model for program behaviorCommunications of the ACM, 1968
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966