Working Sets Past and Present
- 1 January 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-6 (1), 64-84
- https://doi.org/10.1109/tse.1980.230464
Abstract
A program's working set is the collection of segments (or pages) recently referenced. This concept has led to efficient methods for measuring a program's intrinsic memory demand; it has assisted in undetstanding and in modeling program behavior; and it has been used as the basis of optimal multiprogrammed memory management. The total cost of a working set dispatcher is no larger than the total cost of other common dispatchers. This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance.Keywords
This publication has 81 references indexed in Scilit:
- Program behavior and the page-fault-frequency replacement algorithmComputer, 1976
- Fundamental operational laws of computer system performanceActa Informatica, 1976
- A decomposable model of program paging behaviourActa Informatica, 1976
- Decomposability, instabilities, and saturation in multiprogramming systemsCommunications of the ACM, 1975
- Predicting Working Set SizesIBM Journal of Research and Development, 1975
- An Analysis of Page Allocation Strategies for Multiprogramming Systems with Virtual MemoryIBM Journal of Research and Development, 1973
- A study of storage partitioning using a mathematical model of localityCommunications of the ACM, 1972
- Further experimental data on the behavior of programs in a paging environmentCommunications of the ACM, 1968
- The working set model for program behaviorCommunications of the ACM, 1968
- A study of the effect of user program optimization in a paging systemPublished by Association for Computing Machinery (ACM) ,1967