Multiprogrammed memory management
- 1 June 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 63 (6), 924-939
- https://doi.org/10.1109/proc.1975.9857
Abstract
A queueing network is used to show that the page-fault-rate functions of active programs axe the critical factors in system processing efficiency. Properties of page-fault functions are set forth in tenns of a locality model of program behavior. Memory management policies are grouped into two fixed-partition and three variable-partition classes acording to their methods of allocating memory and controlling the multiprogramming load. It is concluded that the so-called working set policies can be expected to yield the lowest paging rates and highest processing efficiency of all the classes.Keywords
This publication has 24 references indexed in Scilit:
- A Problem in Multiprogrammed Storage AllocationIEEE Transactions on Computers, 1974
- A note on the calculation of average working set sizeCommunications of the ACM, 1974
- A simple linear model of demand paging performanceCommunications of the ACM, 1974
- Comments on a linear paging modelPublished by Association for Computing Machinery (ACM) ,1974
- Dynamic storage partitioningPublished by Association for Computing Machinery (ACM) ,1973
- Properties of the working-set modelCommunications of the ACM, 1972
- Experimental data on how program behavior affects the choice of scheduler parametersPublished by Association for Computing Machinery (ACM) ,1971
- Virtual MemoryACM Computing Surveys, 1970
- Is automatic “folding” of programs efficient enough to displace manual?Communications of the ACM, 1969
- The working set model for program behaviorCommunications of the ACM, 1968