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
Technical correspondence: Interlude on signals and semephores revisited
Communications of the ACM
Technical corespondence: Thoughtless programming? author's response
Communications of the ACM
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
On the BLI-model of program behaviour
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
An analysis of the performance of the page fault frequency (PFF) replacement algorithm.
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
A study of program locality and lifetime functions
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
An analysis of a use bit page replacement algorithm
ACM '75 Proceedings of the 1975 annual conference
| Hi-index | 0.03 |
Efficient memory management is important for optimizing computer usage. Intuition, simulation, experience, and analysis have contributed to the design of space management algorithms. Analytical models require accurate and concise descriptions of the system's environment. The referencing pattern, describing the sequence of memory addresses, is the environment for memory management problems. One referencing model assigns probabilities to positions in an LRU stack of memory pages. “Local” behavior is easily described using this model. However, the distinctly different behavior among instruction and data references is lost. In this paper we generalize the LRU stack model to an arbitrary number of memory spaces which are selected by the transitions of a Markov chain. The additional detail affects the behavior of the models for a working set management strategy.