Principles of Optimal Page Replacement
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
The working set model for program behavior
Communications of the ACM
Dynamic storage allocation in the Atlas computer, including an automatic use of a backing store
Communications of the ACM
Operating Systems Theory
The VMOS paging algorithm: a practical implementation of the working set model
ACM SIGOPS Operating Systems Review
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
The benchmarking, tuning and analytic modeling of VAX/VMS
SIGMETRICS '79 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems
Segmented FIFO page replacement
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Converting a swap-based system to do paging in an architecture lacking page-referenced bits
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
The A0 inversion model of program paging behavior
The A0 inversion model of program paging behavior
Virtual storage management in the absence of reference bits
Virtual storage management in the absence of reference bits
Hierarchical replacement decisions in hierarchical stores
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Use Bit Scanning in Replacement Decisions
IEEE Transactions on Computers
Some Results on Distribution-Free Analysis of Paging Algorithms
IEEE Transactions on Computers
Two Methods for the Efficient Analysis of Memory Address Trace Data
IEEE Transactions on Software Engineering
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
IEEE Transactions on Computers
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Evaluation techniques for storage hierarchies
IBM Systems Journal
Characterization of branch and data dependencies on programs for evaluating pipeline performance
IEEE Transactions on Computers
Analysis of Distributed Database Access Histories for Buffer Allocation
WISE '00 Proceedings of the First International Conference on Web Information Systems Engineering (WISE'00)-Volume 2 - Volume 2
CRAMM: virtual memory support for garbage-collected applications
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
| Hi-index | 14.98 |
One of the primary motivations for implementing virtual memory is its ability to automatically manage a hierarchy of storage systems with different characteristics. The composite system behaves as if it were a single-level system having the more desirable characteristics of each of its constituent levels. In this paper we extend the virtual memory concept to within the top level of a two-level hierarchy. Here, the top level is thought of as containing two additional levels within it. This hierarchy is not a physical one, but rather an artificial one arising from the employment of two different replacement algorithms. Given two replacement algorithms, one of which has good performance but high implementation cost and the other poor performance but low implementation cost, we propose and analyze schemes that result in an overall algorithm having the performance characteristics of the former and the cost characteristics of the latter. We discuss the suitability of such schemes in the management of storage hierarchies that lack page reference bits.