Transient-free working-set statistics
Communications of the ACM
Anomalies with variable partition paging algorithms
Communications of the ACM
Characteristics of program localities
Communications of the ACM
MIN—an optimal variable-space page replacement algorithm
Communications of the ACM
On the construction of a representative synthetic workload
Communications of the ACM
A note on the calculation of average working set size
Communications of the ACM
A study of storage partitioning using a mathematical model of locality
Communications of the ACM
Properties of the working-set model
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Operating Systems Theory
A study of program locality and lifetime functions
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Efficient and realistic simulation of disk cache performance
ANSS '88 Proceedings of the 21st annual symposium on Simulation
Long term file migration: development and evaluation of algorithms
Communications of the ACM
A Short Theory of Multiprogramming
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
ACM SIGMETRICS Performance Evaluation Review
Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
| Hi-index | 48.23 |
The working-set concept is extended for programs that reference segments of different sizes. The generalized working-set policy (GWS) keeps as its resident set those segments whose retention costs do not exceed their retrieval costs. The GWS is a model for the entire class of demand-fetching memory policies that satisfy a resident-set inclusion property. A generalized optimal policy (GOPT) is also defined; at its operating points it minimizes aggregated retention and swapping costs. Special cases of the cost structure allow GWS and GOPT to simulate any known stack algorithm, the working set, and VMIN. Efficient procedures for computing demand curves showing swapping load as a function of memory usage are developed for GWS and GOPT policies. Empirical data from an actual system are included.