Analytic modelling of “working set like” replacement algorithms
暂无分享,去创建一个
[1] E. Sadeh,et al. An analysis of the performance of the page fault frequency (PFF) replacement algorithm. , 1975, SOSP.
[2] Juan Rodriguez-Rosell,et al. The optimal choice of window sizes for working set dispatching , 1974, SIGMETRICS '74.
[3] James B. Morris,et al. Demand paging through utilization of working sets onr the MANIAC II , 1972, CACM.
[4] Walter J. Doherty,et al. Scheduling TSS/360 for responsiveness , 1970, AFIPS '70 (Fall).
[5] Juan Rodriguez-Rosell,et al. The design, implementation, and evaluation of a working set dispatcher , 1973, Commun. ACM.
[6] Wesley W. Chu,et al. The page fault frequency replacement algorithm , 1972, AFIPS '72 (Fall, part I).
[7] William Todd Marshall. A unified approach to the evaluation of a class of working set like replacement algorithms , 1979 .
[8] Juan Rodriguez-Rosell. Experimental Data on How Program Behavior Affects the Choice of Scheduler Parameters , 1971, SOSP.
[9] Peter J. Denning,et al. Properties of the working-set model , 1972, CACM.
[10] Daniel G. Bobrow,et al. TENEX, a paged time sharing system for the PDP - 10 , 1972, CACM.
[11] Wesley W. Chu,et al. Analysis of the PFF replacement algorithm via a semi-Markov model , 1976, CACM.