Garbage Collection Techniques
暂无分享,去创建一个
[1] Eiichi Goto,et al. Genetic Order and Compactifying Garbage Collectors , 1978, Inf. Process. Lett..
[2] Hans-Juergen Boehm,et al. Garbage collection in an uncooperative environment , 1988, Softw. Pract. Exp..
[3] William M. Waite,et al. Implementing software for non-numeric applications , 1973 .
[4] James W. Stamos,et al. Static grouping of small objects to enhance performance of a paged virtual memory , 1984, TOCS.
[5] Douglas W. Clark. Measurements of Dynamic List Structure Use in Lisp , 1979, IEEE Transactions on Software Engineering.
[6] R. J. M. Hughes. A semi‐incremental garbage collection algorithm , 1982 .
[7] Joseph Weizenbaum. Symmetric list processor , 1963, CACM.
[8] Allen Wirfs-Brock,et al. A third generation Smalltalk-80 implementation , 1986, OOPSLA 1986.
[9] Toshiyuki Hama,et al. A Light-Weight Prolog Garbage Collector , 1988, FGCS.
[10] Ricki Blau. Paging on an object-oriented personal computer for Smalltalk , 1983, Perform. Evaluation.
[11] Robert Fenichel,et al. A LISP garbage-collector for virtual-memory computer systems , 1969, CACM.
[12] Henry Lieberman,et al. A real-time garbage collector based on the lifetimes of objects , 1983, CACM.
[13] David S. Wise. Stop-and-Copy and One-Bit Reference Counting , 1993, Inf. Process. Lett..
[14] Douglas W. Clark,et al. An empirical study of list structure in Lisp , 1977, CACM.
[15] Tom Axford. Reference Counting of Cyclic Graphs for Functional Programs , 1990, Comput. J..
[16] Henry G. Baker,et al. The treadmill: real-time garbage collection without motion sickness , 1992, SIGP.
[17] Tom Moher,et al. Design of the opportunistic garbage collector , 1989, OOPSLA 1989.
[18] Leslie Lamport,et al. On-the-fly garbage collection: an exercise in cooperation , 1975, CACM.
[19] Guy L. Steele,et al. Multiprocessing compactifying garbage collection , 1975, CACM.
[20] F. Lockwood Morris,et al. A time- and space-efficient garbage compaction algorithm , 1978, CACM.
[21] Benjamin G. Zorn,et al. Comparative performance evaluation of garbage collection algorithms , 1989 .
[22] Evan Tick,et al. Evaluation of Parallel Copying Garbage Collection on a Shared-Memory Multiprocessor , 1993, IEEE Trans. Parallel Distributed Syst..
[23] Daniel G. Bobrow,et al. A note on hash linking , 1975, CACM.
[24] Daniel G. Bobrow,et al. An efficient, incremental, automatic garbage collector , 1976, CACM.
[25] Akira Hattori,et al. Generation Type Garbage Collection for Parallel Logic Languages , 1990, NACLP.
[26] David Gries. The Schorr-Waite graph marking algorithm , 2004, Acta Informatica.
[27] Frank Jackson,et al. Tenuring policies for generation-based storage reclamation , 1988, OOPSLA 1988.
[28] Henry G. Baker,et al. List processing in real time on a serial computer , 1978, CACM.
[29] George E. Collins,et al. A method for overlapping and erasure of lists , 1960, CACM.
[30] James William Stamos,et al. A large object-oriented virtual memory: grouping strategies, measurements, and performance , 1982 .
[31] Takashi Chikayama,et al. Multiple Reference Management in Flat GHC , 1987, International Conference on Logic Programming.
[32] Benjamin G Zorn. Barrier Methods for Garbage Collection ; CU-CS-494-90 , 1990 .
[33] Patrick Sobalvarro,et al. A Lifetime-based Garbage Collector for LISP Systems on General- Purpose Computers , 1988 .
[34] David R. Lester. Distributed Garbage Collection of Cyclic Structures , 1993, Functional Programming.
[35] William M. Waite,et al. A Compaction Procedure for Variable-Length Storage Elements , 1967, Comput. J..
[36] Daniel P. Friedman,et al. The one-bit reference count , 1977 .
[37] Marvin Minsky,et al. A LISP Garbage Collector Algorithm Using Serial Secondary Storage , 1963 .
[38] Barry Hayes. Using key object opportunism to collect old objects , 1991, OOPSLA 1991.
[39] A. C. Norman,et al. Some practical methods for rapid combinator reduction , 1984, LFP '84.
[40] John McCarthy,et al. Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.
[41] D. I. Bevan,et al. Distributed Garbage Collection Using Reference Counting , 1987, PARLE.
[42] Henry G. Baker,et al. Infant mortality and generational garbage collection , 1993, SIGP.
[43] Andrew W. Appel,et al. Simple generational garbage collection and fast allocation , 1989, Softw. Pract. Exp..
[44] Taiichi Yuasa,et al. Real-time garbage collection on general-purpose machines , 1990, J. Syst. Softw..
[45] William M. Waite,et al. An efficient machine-independent procedure for garbage collection in various list structures , 1967, CACM.
[46] Alexandru Nicolau,et al. Comparison of Compacting Algorithms for Garbage Collection , 1983, TOPL.
[47] Benjamin G. Zorn,et al. The measured cost of conservative garbage collection , 1993, Softw. Pract. Exp..
[48] David S. Wise. Morris's Garbage Compaction Algorithm Restores Reference Counts , 1979, TOPL.
[49] David A. Fisher,et al. Bounded Workspace Garbage Collection in an Address-Order Preserving List Processing Environment , 1974, Information Processing Letters.
[50] Frank Jackson,et al. An adaptive tenuring policy for generation scavengers , 1992, TOPL.
[51] Paul R. Wilson,et al. Uniprocessor Garbage Collection Techniques , 1992, IWMM.
[52] Chris J. Cheney. A nonrecursive list compacting algorithm , 1970, Commun. ACM.
[53] Feliks Kluzniak,et al. Compile Time Garbage Collection for Ground Prolog , 1988, ICLP/SLP.
[54] H. B. M. Jonkers,et al. A Fast Garbage Compaction Algorithm , 1979, Inf. Process. Lett..
[55] Lu Xu,et al. Distributed Garbage Collection for the Parallel Inference Engine PIE64 , 1989, NACLP.
[56] Paul Watson,et al. An Efficient Garbage Collection Scheme for Parallel Computer Architectures , 1987, PARLE.
[57] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .
[58] Andrew W. Appel,et al. Garbage Collection can be Faster than Stack Allocation , 1987, Inf. Process. Lett..
[59] Robert Allen Shaw,et al. Empirical analysis of a LISP system , 1988 .