A comparative evaluation of parallel garbage collector implementations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2624, Issue , 2003, Pages 177-192

  Attanasio, Clement R ^a   Bacon, David F ^a   Cocchi, Anthony ^a   Smith, Stephen ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

JAVA PROGRAMMING LANGUAGE; NETWORK MANAGEMENT; REFUSE COLLECTION;

ASYMPTOTIC PERFORMANCE; COMPARATIVE EVALUATIONS; COPYING COLLECTOR; GARBAGE COLLECTION; GENERATIONAL COLLECTOR; JAVA VIRTUAL MACHINES; MULTIPROCESSOR SERVERS; PARALLEL GARBAGE COLLECTORS;

PARALLEL PROCESSING SYSTEMS;

EID: 35248846948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-35767-x_12     Document Type: Review

References (14)

1. ALPERN, B., ET AL. Implementing Jalapeño in Java. In Proc. of the ACM Conf. on Object-Oriented Programming, Systems, Languages, and Applications (Oct. 1999). SIGPLAN Notices, 34, 10, 314-324.
2. ALPERN, B., ET AL. The Jalapeño virtual machine. IBM Syst. J. 39, 1 (2000), 211-238.
3. ARNOLD, M., FINK, S., GROVE, D., M.HIND, AND SWEENEY, P. Adaptive optimization in the Jalapeño JVM. In Proc. of the ACM Conf. on Object-Oriented Programming, Systems, Languages, and Applications (Oct. 2000). SIGPLAN Notices, 35, 10.
4. BOEHM, H.-J. Fast multiprocessor memory allocation and garbage collection. Tech. Rep. HPL-2000-165, Hewlett-Packard Laboratories, Dec. 2000.
5. BOEHM, H.-J., AND WEISER, M. Garbage collection in an uncooperative environment. Software - Practice and Experience 18, 9 (1988), 807-820.
6. CRAMMOND, J. A garbage collection algorithm for shared memory parallel processors. International Journal Of Parallel Programming 17, 6 (1988), 497-522.
7. ENDO, T., TAURA, K., AND YONEZAWA, A. A scalable mark-sweep garbage collector on large-scale shared-memory machines. In Proc. of Supercomputing '97 (San Jose, California, Nov. 1997), IEEE Computer Society Press, Los Alamitos, California.
8. FITZGERALD, R., AND TARDITI, D. The case for profile-directed selection of garbage collectors. In ISMM [12], pp. 111-120.
9. FLOOD, C. H., DETLEFS, D., SHAVIT, N., AND ZHANG, X. Parallel garbage collection for shared memory multiprocessors. In Proceedings of the Usenix Java Virtual Machine Research and Technology Symposium (Monterey, California, Apr. 2001).
10. HALSTEAD, R. H. Multilisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct. 1985), 501-538.
11. HERLIHY, M., AND MOSS, J. E. B. Lock-free garbage collection for multiprocessors. IEEE Transactions on Parallel and Distributed Systems 3, 3 (May 1992).
12. Proceedings of the ACM SIGPLAN International Symposium on Memory Management (Minneapolis, MN, Oct. 2000), SIGPLAN Notices 36, 1.
13. KÜCHLIN, W. A space-efficient parallel garbage collection algorithm. In Proceedings of Fifth ACM International Conference on Supercomputing (June 1991), pp. 40-46.
14. PRINTEZIS, T., AND DETLEFS, D. A generational mostly-concurrent garbage collector. In ISMM [12], pp. 143-154.