论文信息 - Real Time Generation of MIN Distance Strings

Real Time Generation of MIN Distance Strings

A simple proof is presented for an old result: the stack distance string for the optimal paging algorithm, MIN, can be generated in real time at the same overhead as any general stack algorithm.

Peter J. Denning

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

[2] Laszlo A. Belady,et al. On-Line Measurement of Paging Behavior by the Multivalued MIN Algorithm , 1974, IBM J. Res. Dev..

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

[4] R. S. Fabry,et al. MIN—an optimal variable-space page replacement algorithm , 1976, CACM.

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

[6] Peter J. Denning,et al. The Computation and Use of Optimal Paging Curves , 1975 .