A study of storage partitioning using a mathematical model of locality
- 1 March 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 15 (3) , 185-190
- https://doi.org/10.1145/361268.361280
Abstract
Both fixed and dynamic storage partitioning procedures are examined for use in multiprogramming systems. The storage requirement of programs is modeled as a stationary Gaussian process. Experiments justifying this model are described. By means of this model dynamic storage partitioning is shown to provide substantial increases in storage utilization and operating efficiency over fixed partitioning.Keywords
This publication has 7 references indexed in Scilit:
- Properties of the working-set modelCommunications of the ACM, 1972
- Probability Models for Buffer Storage Allocation ProblemsJournal of the ACM, 1971
- Principles of Optimal Page ReplacementJournal of the ACM, 1971
- Virtual MemoryACM Computing Surveys, 1970
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970
- Dynamic space-sharing in computer systemsCommunications of the ACM, 1969
- Further experimental data on the behavior of programs in a paging environmentCommunications of the ACM, 1968