Properties of the working-set model
暂无分享,去创建一个
[1] M. Rosenblatt. A CENTRAL LIMIT THEOREM AND A STRONG MIXING CONDITION. , 1956, Proceedings of the National Academy of Sciences of the United States of America.
[2] V. Pugachev. CHAPTER 11 – STATIONARY RANDOM FUNCTIONS , 1965 .
[3] Laszlo A. Belady,et al. A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..
[4] E. G. Coffman,et al. Interarrival statistics for time sharing systems , 1966, CACM.
[5] Barbara S. Brawn,et al. Program behavior in a paging environment , 1899, AFIPS '68 (Fall, part II).
[6] Peter J. Denning,et al. Resource allocation in multiprocess computer systems , 1968 .
[7] D. Sayre,et al. Is automatic “folding” of programs efficient enough to displace manual? , 1969, CACM.
[8] Norman Weizer,et al. Virtual memory management in a paging environment , 1899, AFIPS '69 (Spring).
[9] Irving L. Traiger,et al. Evaluation Techniques for Storage Hierarchies , 1970, IBM Syst. J..
[10] Walter J. Doherty,et al. Scheduling TSS/360 for responsiveness , 1970, AFIPS '70 (Fall).
[11] P. E. Jackson,et al. Estimates of distributions of random variables for certain computer communications traffic models , 1970, CACM.
[12] Alfred V. Aho,et al. Principles of Optimal Page Replacement , 1971, J. ACM.
[13] Edward G. Coffman,et al. A study of storage partitioning using a mathematical model of locality , 1972, OPSR.