A Comparison of Dynamic and Static Virtual Memory Allocation Algorithms
- 1 January 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-7 (1) , 122-131
- https://doi.org/10.1109/tse.1981.234515
Abstract
In this paper we compare the performance of virtual memory allocation algorithms. The primary measure of performance is the space-time product of primary memory occupancy, or space-time cost, used by a program during its execution. Using DMIN, an optimal dynamic aliocation algorithm, we compute the minimum space-time cost achievable for some benchmark program runs. We compare the DMIN space-time cost with the space-time cost from: MIN, an optimal static allocation algorithm, VMIN, an optimal variable space algorithm, and two heuristic dynamic allocation algorithms. the page fault frequency algorithm and the damped working set algorithm.Keywords
This publication has 7 references indexed in Scilit:
- A Modified Working Set Paging AlgorithmIEEE Transactions on Computers, 1976
- MIN—an optimal variable-space page replacement algorithmCommunications of the ACM, 1976
- The page fault frequency replacement algorithmPublished by Association for Computing Machinery (ACM) ,1972
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970
- Dynamic space-sharing in computer systemsCommunications of the ACM, 1969
- The working set model for program behaviorCommunications of the ACM, 1968
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966