Two-Level Replacement Decisions in Paging 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 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.

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

[2]  M. Tech.  UseBitScanning inReplacement Decisions , 1979 .

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

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

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

[6]  H FogelMarc.  The VMOS paging algorithm , 1974 .

[7]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

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

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

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

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

[12]  Peter J. Denning,et al.  The working set model for program behavior , 1968, CACM.

[13]  Yakov A. Kogan,et al.  Some Results on Distribution-Free Analysis of Paging Algorithms , 1976, IEEE Transactions on Computers.

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

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

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

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

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

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

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

[21]  Özalp Babaoǧlu,et al.  Hierarchical replacement decisions in hierarchical stores , 1982, SIGMETRICS '82.

[22]  E. Gelenbe.  B73-10 Time Sharing Systems , 1973, IEEE Transactions on Computers.

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

[24]  Alan Jay Smith,et al.  Two Methods for the Efficient Analysis of Memory Address Trace Data , 1977, IEEE Transactions on Software Engineering.