An efficient on-the-fly cycle collection

ACM Transactions on Programming Languages and Systems

Volumn 29, Issue 4, 2007, Pages

  Paz, Harel ^a   Bacon, David F ^b   Kolodner, Elliot K ^c   Petrank, Erez ^a   Rajan, V T ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

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

^c IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

Concurrent cycle collection; Garbage collection; Memory management; Programming languages; Reference counting; Runtime systems

Indexed keywords

PROBLEM SOLVING; SLIDING MODE CONTROL; STORAGE ALLOCATION (COMPUTER);

CONCURRENT CYCLE COLLECTION; MEMORY MANAGEMENT; REFERENCE COUNTING; RUNTIME SYSTEMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 34547944236     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1255450.1255453     Document Type: Article

References (48)

1. ALPERN, B., ATTANASIO, C. R., COCCHI, A., LIEBER, D., SMITH, S., NGO, T., BARTON, J. J., HUMMEL, S. F., SHEPERD, J. C., AND MERGEN, M. 1999. Implementing Jalapeño in Java. In OOPSLA'99 ACM Conference on Object-Oriented Systems, Languages and Applications. ACM SIGPLAN Notices, vol. 34(10). ACM Press, Denver, CO, 314-324.
2. AZATCHI, H., LEVANONI, Y., PAZ, H., AND PETRANK, E. 2003. An on-the-fly mark and sweep garbage collector based on sliding view. OOPSLA03 ACM Conference on Object-Oriented Systems, Languages, and Applications. ACM SIGPLAN Notices. ACM Press, Anaheim, CA.
3. AZATCHI, H. AND PETRANK, E. 2003. Integrating generations with advanced reference counting garbage collectors. In Proceedings of the Compiler Construction: 12th International Conference on Compiler Construction, CC 2003. Lecture Notes in Computer Science, vol. 2622. Springer-Verlag Heidelberg, Warsaw, Poland, 185-199.
4. BACON, D. F., ATTANASIO, C. R., LEE, H. B., RAJAN, V. T., AND SMITH, S. 2001. Java without the coffee breaks: A nonintrusive multiprocessor garbage collector. In Proceedings of SIGPLAN 2001 Conference on Programming Languages Design and Implementation. ACM SIGPLAN Notices. ACM Press, Snowbird, Utah.
5. BACON, D. F. AND RAJAN, V. 2001. Concurrent cycle collection in reference counted systems. In Proceedings of the 15th European Conference on Object-Oriented Programming, ECOOP 2001, J. L. Knudsen, Ed. Lecture Notes in Computer Science, vol. 2072. Springer-Verlag, Budapest.
6. BAKER, H. G. 1978. List processing in real-time on a serial computer. Comm. ACM 21, 4, 280-294.
7. BEN-ARI, M. 1982. On-the-fly garbage collection: New algorithms inspired by program proofs. In Automata, Languages and Programming. Ninth Colloquium, M. Nielsen and E. M. Schmidt, Eds. Springer-Verlag, Aarhus, Denmark, 14-22.
8. BEN-ARI, M. 1984. Algorithms for on-the-fly garbage collection. ACM Trans. Program. Lang. Syst. 6, 3 (July), 333-344.
9. BLACKBURN, S. M. AND MCKINLEY, K. S. 2003. Ulterior reference counting: Fast garbage collection without a long wait. OOPSLA'03 ACM Conference on Object-Oriented Systems, Languages, and Applications. ACM SIGPLAN Notices. ACM Press, Anaheim, CA.
10. BOBROW, D. G. 1980. Managing re-entrant structures using reference counts. ACM Trans. Program. Lang. Syst. 2, 3 (July), 269-273.
11. BOEHM, H.-J., DEMERS, A. J., AND SHENKER, S. 1991. Mostly parallel garbage collection. ACM SIGPLAN Notices 26, 6, 157-164.
12. CHRISTOPHER, T. W. 1984. Reference count garbage collection. Software Practice and Experience 14, 6 (June), 503-507.
13. COLLINS, G. E. 1960. A method for overlapping and erasure of lists. Comm. ACM 3, 12 (Dec.), 655-657.
14. DEMERS, A., WEISER, M., HAYES, B., BOEHM, H.-J., BOBROW, D. G., AND SHENKER, S. 1990. Combining generational and conservative garbage collection: Framework and implementations. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages. ACM SIGPLAN Notices. ACM Press, San Francisco, CA, 261-269.
15. DEUTSCH, L. P. AND BOBROW, D. G. 1976. An efficient incremental automatic garbage collector. Comm. ACM19, 9 (Sept.), 522-526.
16. DIJKSTRA, E. W., LAMPORT, L., MARTIN, A. J., SCHOLTEN, C. S., AND STEFFENS, E. F. M. 1978. On-the-fly garbage collection: An exercise in cooperation. Comm. ACM 21, 11 (Nov.), 965-975.
17. DOLIGEZ, D. AND GONTHIER, G. 1994. Portable, unobtrusive garbage collection for multiprocessor systems. In Conference Record of the Twenty-first Annual ACM Symposium on Principles of Programming Languages. ACM SIGPLAN Notices. ACM Press, Portland, OR.
18. DOLIGEZ, D. AND LEROY, X. 1993. A concurrent generational garbage collector for a multi-threaded implementation of ML. In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages. ACM SIGPLAN Notices. ACM Press, 113-123.
19. DOMANI, T., KOLODNER, E., AND PETRANK, E. 2000. A generational on-the-fly garbage collector for Java. In Proceedings of SIGPLAN 2000 Conference on Programming Languages Design and Implementation. ACM SIGPLAN Notices. ACM Press, Vancouver.
20. ELLIS, J. R., LI, K., AND APPEL, A. W. 1988. Real-time concurrent collection on stock multiprocessors. Tech. Rep. DEC-SRC-TR-25, DEC Systems Research Center, Palo Alto, CA. Feb.
21. ENDO, T., TAURA, K., AND YONEZAWA, A. 1997. A scalable mark-sweep garbage collector on largescale shared-memory machines. In Proceedings of High Performance Computing and Networking (SC'97).
22. FLOOD, C., DETLEFS, D., SHAVIT, N., AND ZHANG, C. 2001. Parallel garbage collection for shared memory multiprocessors. In Usenix Java Virtual Machine Research and Technology Symposium (JVM '01). Monterey, CA.
23. GRIES, D. 1977. An exercise in proving parallel programs correct. Comm. ACM 20, 12 (Dec.), 921-930.
24. HUDSON, R. L. AND MOSS, J. E. B. 2001. Sapphire: Copying GC without stopping the world. In Joint ACM Java Grande-ISCOPE 2001 Conference. Stanford University, CA.
25. JONES, R. E. 1996. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester.
26. KERMANY, H. AND PETRANK, E. 2006. The compressor: Concurrent, incremental, and parallel compaction. In Proceedings of SIGPLAN 2006 Conference on Programming Languages Design and Implementation. ACM SIGPLAN Notices. ACM Press, Ottawa, Canada.
27. KOLODNER, E. K. AND PETRANK, E. 2004. Parallel copying garbage collection using delayed allocation. In Parallel Processing Letters. Vol. 14.
28. KUNG, H. T. AND SONG, S. W. 1977. An efficient parallel garbage collection system and its correctness proof. In IEEE Symposium on Foundations of Computer Science. IEEE Press, 120-131.
29. LAMPORT, L. 1976. Garbage collection with multiple processes: an exercise in parallelism. In Proceedings of the 1976 International Conference on Parallel Processing. 50-54.
30. LEVANONI, Y. AND PETRANK, E. 1999. A scalable reference counting garbage collector. Tech. Rep. CS-0967, Technion - Israel Institute of Technology, Haifa, Israel. (Nov).
31. LEVANONI, Y. AND PETRANK, E. 2001. An on-the-fly reference counting garbage collector for Java. In OOPSLA'01 ACM Conference on Object-Oriented Systems, Languages and Applications. ACM SIGPLAN Notices, vol. 36(10). ACM Press, Tampa, FL.
32. LEVANONI, Y. AND PETRANK, E. 2006. An on-the-fly reference-counting garbage collector for Java. ACM Transactions on Programming Languages and Systems 28, 1 (Jan.), 1-69.
33. LINS, R. D. 1992. Cyclic reference counting with lazy mark-scan. Information Processing Letters 44, 4, 215-220.
34. Also Computing Laboratory Technical Report 75, University of Kent, July 1990.
35. LINS, R. D. 2002. An efficient algorithm for cyclic reference counting. Information Processing Letters 83, 145-150.
36. MARTINEZ, A. D., WACHENCHAUZER, R., AND LINS, R. D. 1990. Cyclic reference counting with local mark-scan. Information Processing Letters 34, 31-35.
37. MCBETH, J. H. 1963. On the reference counter method. Communications of the ACM 6, 9 (Sept.), 575.
38. MOON, D. A. 1984. Garbage collection in a large LISP system. In Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming, G. L. Steele, Ed. ACM Press, Austin, TX, 235-245.
39. NILSEN, K. D., MITRA, S., AND LEE, S. J. 2000. Method for efficient soft real-time execution of portable byte code computer programs. http://www.patentstorm.us/patents/6081665.html.
40. PAZ, H., PETRANK, E., BACON, D. F., RAJAN, V., AND KOLODNER, E. K. 2005a. An efficient on-the-fly cycle collection. In Proceedings of the 14th International Conference on Compiler Construction. Springer-Verlag, Edinburgh.
41. PAZ, H., PETRANK, E., AND BLACKBURN, S. M. 2003. Age-oriented garbage collection. Tech. Rep. CS-2003-08, Technion, Israel Institute of Technology. Oct. http://www.cs.technion.ac.il/users/wwwb/ cgi-bin/tr-info.cgi?2003/CS/CS-2003-08.
42. PAZ, H., PETRANK, E., AND BLACKBURN, S. M. 2005b. Age-oriented garbage collection. In Proceedings of the 14th International Conference on Compiler Construction. Springer-Verlag, Edinburgh.
43. PRINTEZIS, T. AND DETLEFS, D. 2000. A generational mostly-concurrent garbage collector. In ISMM 2000 Proceedings of the Second International Symposium on Memory Management, T. Hosking, Ed. ACM SIGPLAN Notices, vol. 36(1). ACM Press, Minneapolis, MN.
44. SPEC BENCHMARKS. 2000. Standard Performance Evaluation Corporation. http://www.spec.org/.
45. STEELE, G. L. 1975. Multiprocessing compactifying garbage collection. Comm. ACM 18, 9 (Sept.), 495-508.
46. STEELE, G. L. 1976. Corrigendum: Multiprocessing compactifying garbage collection. Comm. ACM 19, 6 (June), 354.
47. WEIZENBAUM, J. 1963. Symmetric list processor. Comm. ACM 6, 9 (Sept.), 524-544.
48. WILSON, P. R., JOHNSTONE, M. S., NEELY, M., AND BOLES, D. 1995. Dynamic storage allocation: A survey and critical review. In Proceedings of International Workshop on Memory Management, H. Baker, Ed. Lecture Notes in Computer Science, vol. 986. Springer-Verlag, Kinross, Scotland.