Program behavior prediction and prepaging

作者: Michel Martinez

DOI: 10.1007/BF00262979

关键词:

摘要: The design and evaluation of a prepaging technique is presented. It consists in the preloading, at instants which page-faults occur, those pages whose use future most likely. These are determined as function an a-priori knowledge program behavior. We shall first present two tools for predicting that based on Markov memory reference transition model, second semi-Markov model page-fault transitions. Both methods successively experimented by paging algorithm allowing prepaging. Experimentation shows can significantly improve performance algorithm, especially when prediction transitions between page-faults. sensitivity to various working conditions tested. Implementation examined shown be feasible without special hardware devices. study completed influence global system performance. Some common cases architecture experimentation show non-negligible increase CPU utilization.

参考文章(18)
Michel Parent, Dominique Potier, A note on the influence of program loading on the page fault rate Acta Informatica. ,vol. 8, pp. 359- 370 ,(1977) , 10.1007/BF00271344
Alfred V Aho, Peter J Denning, Jeffrey D Ullman, None, Principles of Optimal Page Replacement Journal of the ACM. ,vol. 18, pp. 80- 93 ,(1971) , 10.1145/321623.321632
Laszlo A. Belady, None, A study of replacement algorithms for a virtual-storage computer Ibm Systems Journal. ,vol. 5, pp. 78- 101 ,(1966) , 10.1147/SJ.52.0078
Laszlo A Belady, CJ Kuehner, None, Dynamic space-sharing in computer systems Communications of The ACM. ,vol. 12, pp. 282- 288 ,(1969) , 10.1145/362946.363002
Juan Rodriguez-Rosell, Jean-Pierre Dupuy, The evaluation of a time-sharing page demand system Proceedings of the November 16-18, 1971, fall joint computer conference on - AFIPS '71 (Fall). pp. 759- 765 ,(1971) , 10.1145/1478873.1478970
Barton G. Prieve, R. S. Fabry, MIN—an optimal variable-space page replacement algorithm Communications of the ACM. ,vol. 19, pp. 295- 297 ,(1976) , 10.1145/360051.360231
J. P. Buzen, Fundamental operational laws of computer system performance Acta Informatica. ,vol. 7, pp. 167- 182 ,(1976) , 10.1007/BF00265769
Dominique Potier, Analysis of demand paging policies with swapped working sets ACM SIGOPS Operating Systems Review. ,vol. 11, pp. 125- 131 ,(1977) , 10.1145/1067625.806555
Peter J Denning, Kevin C Kahn, None, An L=S criterion for optimal multiprogramming Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation - SIGMETRICS '76. pp. 219- 229 ,(1976) , 10.1145/800200.806198
M. A. Franklin, R. K. Gupta, Computation of page fault probability from program transition diagram Communications of the ACM. ,vol. 17, pp. 186- 191 ,(1974) , 10.1145/360924.360928