Hierarchical replacement decisions in hierarchical stores

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 each of the levels of the hierarchy. Each 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.

[1]  Laszlo A. Belady,et al.  A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..

[2]  Irving L. Traiger,et al.  Evaluation Techniques for Storage Hierarchies , 1970, IBM Syst. J..

[3]  Peter J. Denning,et al.  Virtual memory , 1970, CSUR.

[4]  Forest Baskett,et al.  The A0 inversion model of program paging behavior , 1976 .

[5]  Edward D. Lazowska.  The benchmarking, tuning and analytic modeling of VAX/VMS , 1979, SIGMETRICS '79.

[6]  Henry M. Levy,et al.  Segmented FIFO page replacement , 1981, SIGMETRICS '81.

[7]  Edward D. Lazowska.  The benchmarking, tuning and analytic modeling of VAX/VMS , 1979, SIGMETRICS Perform. Evaluation Rev..

[8]  W. Frank King,et al.  Analysis of Demand Paging Algorithms , 1971, IFIP Congress.

[9]  Özalp Babaoglu,et al.  Converting a swap-based system to do paging in an architecture lacking page-referenced bits , 1981, SOSP.

[10]  Alfred V. Aho,et al.  Principles of Optimal Page Replacement , 1971, J. ACM.

[11]  Tom Kilburn,et al.  One-Level Storage System , 1962, IRE Trans. Electron. Comput..

[12]  Marc H. Fogel,et al.  The VMOS paging algorithm: a practical implementation of the working set model , 1974, OPSR.

[13]  Peter A. Franaszek,et al.  Use Bit Scanning in Replacement Decisions , 1979, IEEE Transactions on Computers.

[14]  Alan Jay Smith,et al.  Bibliography on paging and related topics , 1978, OPSR.

[15]  M. Hofri,et al.  The Working Set Size Distribution for the Markov Chain Model of Program Behavior , 1982, SIAM J. Comput..

[16]  Ozalp Babaoglu.  Virtual storage management in the absence of reference bits , 1981 .

[17]  John A. Fotheringham,et al.  Dynamic storage allocation in the Atlas computer, including an automatic use of a backing store , 1961, Commun. ACM.

[18]  Erol Gelenbe,et al.  A Unified Approach to the Evaluation of a Class of Replacement Algorithms , 1973, IEEE Transactions on Computers.