Mdtiprogrammed Memory Management

[1]  R.R. Muntz,et al.  Analytic modeling of interactive systems , 1975, Proceedings of the IEEE.

[2]  Domenico Ferrari,et al.  Improving locality by critical working sets , 1974, CACM.

[3]  Irving L. Traiger,et al.  A note on the calculation of average working set size , 1974, CACM.

[4]  Wesley W. Chu,et al.  Performance of the Page Fault Frequency Replacement Algorithm in a Multiprogramming Environment , 1974, IFIP Congress.

[5]  Peter J. Denning,et al.  Comments on a linear paging model , 1974, SIGMETRICS '74.

[6]  Juan Rodriguez-Rosell,et al.  The design, implementation, and evaluation of a working set dispatcher , 1973, Commun. ACM.

[7]  Samuel H. Fuller,et al.  A Page Allocation Strategy for Multiprogramming Systems with Virtual Memory. , 1973, SOSP 1973.

[8]  Maurice V. Wilkes,et al.  The Dynamics of Paging , 1973, Comput. J..

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

[10]  Peter J. Denning,et al.  Dynamic storage partitioning , 1973, SOSP '73.

[11]  Edward G. Coffman,et al.  A study of storage partitioning using a mathematical model of locality , 1972, OPSR.

[12]  Donald J. Hatfield,et al.  Program Restructuring for Virtual Memory , 1971, IBM Syst. J..

[13]  Walter J. Doherty,et al.  Scheduling TSS/360 for responsiveness , 1970, AFIPS '70 (Fall).

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

[15]  D. Sayre,et al.  Is automatic “folding” of programs efficient enough to displace manual? , 1969, CACM.

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