WSCLOCK—a simple and effective algorithm for virtual memory management
暂无分享,去创建一个
[1] Peter J. Denning,et al. Working Sets Past and Present , 1980, IEEE Transactions on Software Engineering.
[2] Peter J. Denning,et al. Virtual memory , 1970, CSUR.
[3] Peter J. Denning,et al. The working set model for program behavior , 1968, CACM.
[4] James B. Morris,et al. Demand paging through utilization of working sets onr the MANIAC II , 1972, CACM.
[5] William T. Marshall,et al. Analytic modelling of “working set like” replacement algorithms , 1979 .
[6] Juan Rodriguez-Rosell,et al. Empirical working set behavior , 1973, Commun. ACM.
[7] William T. Marshall,et al. Analytic modelling of “working set like” replacement algorithms , 1979, SIGMETRICS '79.
[8] Alan Jay Smith. A Modified Working Set Paging Algorithm , 1976, IEEE Transactions on Computers.
[9] S. Schwartz,et al. Properties of the working-set model , 1972, OPSR.
[10] R. S. Fabry,et al. MIN—an optimal variable-space page replacement algorithm , 1976, CACM.
[11] Alan Jay Smith. Multiprogramming and memory contention , 1980, Softw. Pract. Exp..
[12] Richard William Carr,et al. Virtual memory management , 2018 .