A large object-oriented virtual memory: grouping strategies, measurements, and performance

See page 2. This report is a slightly revised version of a thesis submitted to the Department of Electrical Engineering and Computer Science at MIT in partial fulfillment of the requirements for the degrees of Bachelor of Science and Master of Science. CR Categories: 4.35, 4.6, 6.34.

[1]  Thomas C. Lowe.  Automatic segmentation of cyclic program structures based on connectivity and processor timing , 1970, CACM.

[2]  Alan P. Batson,et al.  Program Behavior at the Symbolic Level , 1976, Computer.

[3]  Brian W. Kernighan,et al.  Optimal Sequential Partitions of Graphs , 1971, J. ACM.

[4]  Henry Lieberman,et al.  A Real Time Garbage Collector that can Recover Temporary Storage Quickly. , 1980 .

[5]  W. M. McKeeman,et al.  Language directed computer design , 1899, AFIPS '67 (Fall).

[6]  Daniel H. H. Ingalls,et al.  The Smalltalk-76 programming system design and implementation , 1978, POPL.

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

[8]  Brian Randell,et al.  A note on storage fragmentation and program segmentation , 1969, CACM.

[9]  David C. Wood,et al.  Measurements of segment size , 1969, SOSP '69.

[10]  Richard P. Parmelee,et al.  Virtual Storage and Virtual Machine Concepts , 1972, IBM Syst. J..

[11]  Domenico Ferrari,et al.  The Improvement of Program Behavior , 1976, Computer.

[12]  S. L. Graham,et al.  List Processing in Real Time on a Serial Computer , 1978 .

[13]  Douglas W. Clark,et al.  An empirical study of list structure in Lisp , 1977, CACM.

[14]  Edward G. Coffman,et al.  Organizing matrices and matrix operations for paged memory systems , 1969, Commun. ACM.

[15]  Alan P. Batson,et al.  Segment sizes and liftetimes in Algol 60 programs , 1977, CACM.

[16]  John F. Shoch,et al.  An overview of the programming language Smalltalk-72 , 1979, SIGP.

[17]  Jean-Loup Baer,et al.  Dynamic Improvement of Locality in Virtual Memory Systems , 1976, IEEE Transactions on Software Engineering.

[18]  Barbara S. Brawn,et al.  Program behavior in a paging environment , 1899, AFIPS '68 (Fall, part II).

[19]  G. H. Fine,et al.  Dynamic program behavior under paging , 1966, ACM '66.

[20]  James E. Morrison.  User Program Performance in Virtual Storage Systems , 1973, IBM Syst. J..

[21]  Douglas W. Clark,et al.  A Note on Shared List Structure in LISP , 1978, Inf. Process. Lett..

[22]  D. J. Kuck,et al.  The Use and Performance of Memory Hierarchies: A Survey , 1970 .

[23]  Brian Randell,et al.  Demand paging in perspective , 1968, AFIPS '68 (Fall, part II).

[24]  L. W. Comeau,et al.  A study of the effect of user program optimization in a paging system , 1967, SOSP.

[25]  Peter J. Denning,et al.  Experiments with program locality , 1899, AFIPS '72 (Fall, part I).

[26]  Peter Boehler Bishop,et al.  Computer systems with a very large address space and garbage collection , 1977 .

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

[28]  Edward W. Ver Hoef,et al.  Automatic program segmentation based on Boolean connectivity , 1971, AFIPS '71 (Spring).

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

[30]  Barbara S. Brawn,et al.  Sorting in a paging environment , 1970, Commun. ACM.

[31]  C. Ramamoorthy,et al.  The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers , 1966, ACM '66.