A counterintuitive example of computer paging
暂无分享,去创建一个
A counterexample is exhibited to a natural conjecture concerning the optimal way to group records into pages in the independent reference model of computer paging (an organization is said to be optimal if the “least recently used” miss ratio is minimized).
[1] Alfred V. Aho,et al. Principles of Optimal Page Replacement , 1971, J. ACM.
[2] A. Palmboom,et al. Analysis of Demand Paging Algorithms , 1972, GI Jahrestagung.
[3] Peter J. Denning,et al. Operating Systems Theory , 1973 .
[4] Irving L. Traiger,et al. Evaluation Techniques for Storage Hierarchies , 1970, IBM Syst. J..
[5] Chak-Kuen Wong,et al. On the Optimality of the Probability Ranking Scheme in Storage Applications , 1973, JACM.