Mark and split

International Symposium on Memory Management, ISMM

Volumn 2006, Issue , 2006, Pages 29-39

  Sagonas, Konstantinos ^a,b   Wilhelmsson, Jesper ^a  

^a UPPSALA UNIVERSITY   (Sweden)

^b NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Java; Mark and split; Mark and sweep; Non moving garbage collectors

Indexed keywords

ADAPTIVE SYSTEMS; BENCHMARKING; COSTS; STANDARDS; STORAGE ALLOCATION (COMPUTER);

MARK AND SPLIT; MARK AND SWEEP; NONMOVING GARBAGE COLLECTORS;

ALGORITHMS;

EID: 34247236194     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1133956.1133961     Document Type: Conference Paper

References (12)

1. A. Andersson. General search trees made simple. In Proceedings of the Third Workshop on Algorithms and Data Structures (WADS'93), volume 709 of LNCS, pages 60-71. Springer-Verlag, Aug. 1993.
2. H. G. Baker. The treadmill, real-time garbage collection without motion sickness. SIGPLAN Notices, 27(3):66-70, Mar. 1992.
3. BEA JRockit: Java for the enterprise. Technical White Paper, Dec. 2003.
4. H.-J. Boehm. Mark-sweep vs. copying collection and asymptotic complexity, 1995. Web page describing an IWMM'95 presentation.
5. H.-J. Boehm. Reducing garbage collector cache misses. In T. Hosking, editor, Proceedings of ISMM'2000: ACM SIGPLAN International Symposium on Memory Management, pages 59-64, New York, N.Y., Oct. 2000. ACM Press.
6. C. J. Cheney. A nonrecursive list compacting algorithm. Communications of the ACM, 13(11):677-678, Nov. 1970.
7. Y. C. Chung, S.-M. Moon, K. Ebcioĝlu, and D. Sahlin. Selective sweeping. Software - Practice and Experience, 35(1):15-26, Jan. 2005.
8. R. T. Dimpsey, R. Arora, and K. Kuiper. Java server performance: A case study of building efficient, scalable Jvms. IBM Systems Journal, 39(1): 151-174, 2000.
9. R. J. M. Hughes. A semi-incremental garbage collection algorithm. Software - Practice and Experience, 12(11):1081-1084, Nov. 1982.
10. J. L. McCarthy. Recursive functions of symbolic expressions and their computation by machine, Part I. Communications of the ACM, 3(4):184-195, Apr. 1960.
11. C. Queinnec, B. Beaudoing, and J.-P. Queille. Mark during sweep rather than mark then sweep. In Proceedings of Parallel Architectures and Languages Europe (PARLE'89), volume 365 of LNCS, pages 224-237, Berlin, Germany, June 1989. Springer-Verlag.
12. B. Zorn. Comparing mark-and-sweep and stop-and-copy garbage collection. In Proceedings of the ACM Conference on LISP and Functional Programming, pages 87-98, New York, NY, USA, June 1990. ACM Press.