Selective sweeping

Software - Practice and Experience

Volumn 35, Issue 1, 2005, Pages 15-26

  Chung, Yoo C ^a   Moon, Soo Mook ^a   Ebcioǧlu, Kemal ^b   Sahlin, Dan ^c  

^a Seoul National University   (South Korea)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c ERICSSON RESEARCH   (Sweden)

Author keywords

Garbage collection; Mark and sweep; Selective sweeping

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA PROCESSING; PROGRAM COMPILERS; REFUSE DISPOSAL; STORAGE ALLOCATION (COMPUTER);

GARBAGE COLLECTION; MARK AND SWEEP; SELECTIVE SWEEPING; SWEEPING ALGORITHMS;

ALGORITHMS;

EID: 11144296238     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/spe.624     Document Type: Article

References (15)

1. Chung YC, Moon S-M, Ebcioǧlu K, Sahlin D. Reducing sweep time for a nearly empty heap. 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '00), Boston, MA, January, 2000; 378-389.
2. McCarthy J. Recursive functions of symbolic expressions and their computation by machine. Communications of the ACM 1960; 3:184-195.
3. Appel AW. Garbage collection can be faster than stack allocation. Information Processing Letters 1987; 25(4):275-279.
4. Cheney CJ. A non-recursive list compacting algorithm. Communications of the ACM 1970; 13(11):677-678.
5. Moon S-M, Ebcioǧlu K. A just-in-time compiler. IEEE Computer 2000; 41.
6. Chung YC, Moon S-M. Memory allocation with lazy fits. Proceedings of the 2000 International Symposium on Memory Management (ISMM '00), Minneapolis, MN, October 2000; 65-70.
7. Boehm H-J, Weiser M. Garbage collection in an uncooperative environment. Software - Practice and Experience 1988; 18(9):807-820.
8. SPEC JVM98 benchmarks, http://www.spec.org/osg/jvm98 [19 August 1998].
9. Chung YC, Lee J, Moon S-M. Memory management in the LaTTe Java virtual machine (submitted for publication), 2003.
10. Sahlin D. Making garbage collection independent of the amount of garbage. Research Report SICS/R-87/87008, SICS, 1987. (Appendix to SICS Research Report R86009, Garbage collection for Prolog based on WAM.)
11. Boehm H-J. Mark-sweep vs. copying collection and asymptotic complexity. http://www.hpl.hp.com/personal/Hans_Boehm/gc/complexity.html [1995].
12. Huges RJM. A semi-incremental garbage collection algorithm. Software - Practice and Experience 1982; 12(11):1081-1084.
13. Boehm H-J. Reducing garbage collector cache misses. Proceedings of the 2000 International Symposium on Memory Management (ISMM '00), Minneapolis, MN, October 2000; 59-64.
14. Baker HG. The treadmill, real-time garbage collection without motion sickness. SIGPLAN Notices 1992; 27(3):66-70.
15. Wilson PR, Johnstone MS. Real-time non-copying garbage collection. OOPSLA/ECOOP'93 Workshop on Garbage Collection in Object Oriented Systems, October 1993.