A time invariant working set model for independent reference

Authors:
Vidyadhar Phalke
Affiliations:
Rutgers University, NJ
Venue:
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
Year:
1995

Citing 13
Cited 0

Measurements of a distributed file system

SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
The LRU-K page replacement algorithm for database disk buffering

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Computer architecture (2nd ed.): a quantitative approach

Computer architecture (2nd ed.): a quantitative approach
Empirical results on locality in database referencing

SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The independence of miss ratio on page size

Journal of the ACM (JACM)
Performance Analysis of Cache Memories

Journal of the ACM (JACM)
Virtual Memory

ACM Computing Surveys (CSUR)
MIN—an optimal variable-space page replacement algorithm

Communications of the ACM
Demand paging through utilization of working sets onr the MANIAC II

Communications of the ACM
The working set model for program behavior

Communications of the ACM
Stochastic Analysis of Computer Storage

Stochastic Analysis of Computer Storage
Properties of the Miss Ratio for a 2-Level Storage Model with LRU or FIFO Replacement Strategy and Independent References

IEEE Transactions on Computers
Program Modelling via Inter-Reference Gaps and Applications

MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Under the Independent Reference Model (IRM) of program behavior, we study properties of the C space-time products as defined by Prieve and Fabry [21] for variable memory management algorithms. In particular, we look at the behavior of Denning's Working Set [11] and VMIN [21] algorithms. From the observed properties of these algorithms, we derive an algorithm which either keeps a page always in memory, or does not keep it at all. We show the online optimality of this algorithm under the assumption that the access probabilities are known a priori. Further, we propose a practical version of this algorithm for database and disk buffer management. By using our algorithm, we obtained space-time product improvements up to 41% over the Working Set algorithm.