This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Two-Level Replacement Decisions in Paging Stores
December 1983 (vol. 32 no. 12)
pp. 1151-1159
O. Babaoglu, Department of Computer Science, Cornell University
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.
Index Terms:
working set, FIFO, LRU, Markov chain, page replacement algorithms, UNIX, VAX VMS, virtual memory
Citation:
O. Babaoglu, D. Ferrari, "Two-Level Replacement Decisions in Paging Stores," IEEE Transactions on Computers, vol. 32, no. 12, pp. 1151-1159, Dec. 1983, doi:10.1109/TC.1983.1676176
Usage of this product signifies your acceptance of the Terms of Use.