An on-the-fly reference-counting garbage collector for java

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 1, 2006, Pages 1-69

  Levanoni, Yossi ^a   Petrank, Erez ^b  

^a MICROSOFT   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Garbage collection; Memory management; Programming languages; Reference counting

Indexed keywords

GARBAGE COLLECTION; MEMORY MANAGEMENT; REFERENCE-COUNTING;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STORAGE EQUIPMENT; ELECTRONIC COMMUNITIES; MULTIPROCESSING SYSTEMS; SYNCHRONIZATION;

JAVA PROGRAMMING LANGUAGE;

EID: 33745393872     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1111596.1111597     Document Type: Article

References (52)

1. AHO, A. V., KERNIGHAN, B. W., AND WEINBERGER, P. J. 1988. The AWK Programming Language. Addison-Wesley, Reading, MA.
2. APPEL, A. W., ELLIS, J. R., AND LI, K. 1988. Real-time concurrent collection on stock multiprocessors. ACM SIGPLAN Not. 23, 7, 11-20.
3. AZATCHI, H., LEVANONI, Y., PAZ, H., AND PETRANK, E. 2003. An on-the-fly mark and sweep garbage collector based on sliding views. See OOPSLA [2003], 269-281.
4. AZATCHI, H. AND PETRANK, E. 2003. Integrating generations with advanced reference counting garbage collectors. In International Conference on Compiler Construction (CC'2003). Lecture Notes in Computer Science, vol. 2622. Springer, Berlin, Germany, 185-199.
5. BACON, D., ATTANASIO, D., LEE, H., AND SMITH, S. 2001. Java without the coffee breaks: A non-intrusive multiprocessor garbage collector. In Proceedings of the SIGPLAN 2001 Conference on Programming Languages Design and Implementation. ACM Press, New York, NY, 92-103.
6. BACON, D. AND RAJAN, V. 2001. Concurrent cycle collection in reference counted systems. In Proceedings of 15th European Conference on Object-Oriented Programming (ECOOP 2001, Budapest, Hungary).
7. BAKER, H. G. 1978. List processing in real-time on a serial computer. Commun. ACM 21, 4, 280-94.
8. BAKER, H. G. 1994. Minimizing reference count updating with deferred and anchored pointers for functional data structures. ACM SIGPLAN Not. 29, 9, 38-43.
9. BARTH, J. M. 1977. Shifting garbage collection overhead to compile time. Commun. ACM 20, 7 (July), 513-518.
10. BLACKBURN, S. AND MCKINLEY, K. 2003. Ulterior reference counting: Fast garbage collection without a long wait. See OOPSLA [2003], 344-358.
11. BOEHM, H.-J., DEMERS, A. J., AND SHENKER, S. 1991. Mostly parallel garbage collection. ACM SIGPLAN Not. 26, 6, 157-164.
12. CHIKAYAMA, T. AND KIMURA, Y 1987. Multiple reference management in Flat GHC. In 4th International Conference on Logic Programming. MIT Press, Cambridge, MA, 276-293.
13. COLLINS, G. E. 1960. A method for overlapping and erasure of lists. Commun. ACM 3, 12 (Dec.), 655-657.
14. CRAMMOND, J. 1988. A garbage collection algorithm for shared memory parallel processors. Int. J. Parall. Programm. 17, 6, 497-522.
15. DETREVILLE, J. 1990. Experience with concurrent garbage collectors for Modula-2+. Tech. rep. 64. DEC Systems Research Center, Palo Alto, CA.
16. DEUTSCH, L. P. AND BOBROW, D. G. 1976. An efficient incremental automatic garbage collector. Commun. ACM 19, 9 (Sept.), 522-526.
17. 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. Commun. ACM 21, 11 (Nov.), 965-975.
18. DOLIGEZ, D. AND GONTHIER, G. 1994. Portable, unobtrusive garbage collection for multiprocessor systems. In Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, 70-83.
19. DOLIGEZ, D. AND LEROY, X. 1993. A concurrent generational garbage collector for a multi-threaded implementation of ML. In Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, 113-123.
20. DOMANI, T., KOLODNER, E. K., LEWIS, E., SALANT, E. E., BARABASH, K., LAHAN, I., PETRANK, E., YANOVER, I., AND LEVANONI, Y. 2000. Implementing an on-the-fly garbage collector for Java. See Hosking [2000], 155-166.
21. ENDO, T., TAURA, K., AND YONEZAWA, A. 1997. A scalable mark-sweep garbage collector on largescale shared-memory machines. In Proceedings of the Conference on High Performance Networking and Computing (SC'97). ACM Press, New York, NY, 1-14.
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). USENIX, Berkeley, CA.
23. FURUSOU, S., MATSUOKA, S., AND YONEZAWA, A. 1991. Parallel conservative garbage collection with fast allocation. In OOPSLA/ECOOP '91 Workshop on Garbage Collection in Object-Oriented Systems, Addendum to OOPSLA'91 Proceedings, P. R. Wilson and B. Hayes, Eds. ACM Press, New York, NY.
24. GOLDBERG, A. AND ROBSON, D. 1983. Smalltalk-80: The Language and Its Implementation. Addison-Wesley, Reading, MA.
25. HALSTEAD, R. H. 1985. Multilisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct.), 501-538.
26. HERLIHY, M. AND Moss, J. E. B. 1990. Non-blocking garbage collection for multiprocessors. Tech. rep. CRL 90/9. DEC Cambridge Research Laboratory, Cambridge, MA.
27. HOSKING, A. L., Moss, J. E. B., AND STEFANOVIĆ, D. 1992. A comparative performance evaluation of write barrier implementations. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications, A. Paepcke, Ed. ACM Press, New York, NY, 92-109.
28. HOSKING, T., Ed. 2000. ISMM 2000 Proceedings of the Second International Symposium on Memory Management. ACM Press, New York, NY.
29. HUDSON, R. L. AND Moss, J. E. B. 2003. Copying garbage collection without stopping the world. Concurr. Computat.: Pract. Exp. 15, 3-5, 223-261.
30. JONES, R. E. AND LINS, R. 1996. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester, U.K.
31. KOLODNER, E. K. AND PETRANK, E. 2004. Parallel copying garbage collection using delayed allocation. Parall. Process. Lett. 14, 2. To appear.
32. LEVANONI, Y. AND PETRANK, E. 2001. An on-the-fly reference counting garbage collector for Java. In Proceedings of the 16th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM Press, New York, NY, 367-380.
33. LINS, R. D. AND VASQUES, M. A. 1991. A comparative study of algorithms for cyclic reference counting. Tech. rep. 92. Computing Laboratory, The University of Kent at Canterbury. Canterbury, U.K.
34. MCBETH, J. H. 1963. On the reference counter method. Commun. ACM 6, 9, 575.
35. MILLER, J. S. AND EPSTEIN, B. 1990. Garbage collection in MultiScheme. In US /Japan Workshop on Parallel Lisp. Lecture Notes in Computer Science, vol. 441. Springer, Berlin, Germany, 138-160.
36. OOPSLA. 2003. Proceedings of the 18th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications. ACM Press, New York, NY.
37. OSSIA, Y., BEN-YITZHAK, O., GOFT, I., KOLODNER, E. K., LEIKEHMAN, V., AND OWSHANKO, A. 2002. A parallel, incremental and concurrent GC for servers. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Languages Design and Implementation. ACM Press, New York, NY, 129-140.
38. O'TOOLE, J. W. AND NETTLES, S. M. 1994. Concurrent replicating garbage collection. In Proceedings of the 1994 ACM Conference on LISP and Functional Programming. ACM Press, New York, NY, 34-42.
39. PARK, Y. G. AND GOLDBERG, B. 1995. Static analysis for optimising reference counting. Inf. Process. Lett. 55, 4 (Aug.), 229-234.
40. PLAKAL, M. AND FISCHER, C. N. 2000. Concurrent garbage collection using program slices on multithreaded processors. See Hosking [2000], 94-100.
41. PRINTEZIS, T. AND DETLEFS, D. 2000. A generational mostly-concurrent garbage collector. See Hosking [2000], 143-154.
42. RIANY, Y., SHAVIT, N., AND TOUITOU, D. 1995. Towards a practical snapshot algorithm. In Proceedings of the 3rd Israeli Symposium on the Theory of Computing and Systems. IEEE Press, Los Alamitos, CA, 58-173.
43. ROTH, D. J. AND WISE, D. S. 1999. One-bit counts between unique and sticky. In Proceedings of the First International Symposium on Memory Management, R. Jones, Ed. ACM SIGPLAN Not. 34, 3 (Mar.), 49-56.
44. SOBALVARRO, P. 1988. A lifetime-based garbage collector for Lisp systems on general-purpose computers. Tech. rep. AITR-1417. MIT AI Lab, Cambridge, MA. Also, Bachelor of Science thesis, Massachusetts Institute of Technology, Cambridge, MA.
45. SPEC BENCHMARKS. 2000. Standard Performance Evaluation Corporation. Available online at http://www.spec.org/.
46. STEELE, G. L. 1975. Multiprocessing compactifying garbage collection. Commun. ACM 18, 9 (Sept.), 495-508.
47. STOYE, W. R., CLARKE, T. J. W., AND NORMAN, A. C. 1984. Some practical methods for rapid combinator reduction. In Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming, G. L. Steele, Ed. ACM Press, New York, NY, 159-166.
48. WALL, L. AND SCHWARTZ, R. L. 1991. Programming Perl. O'Reilly and Associates, Inc, Sebastopol, CA.
49. WEIZENBAUM, J. 1963. Symmetric list processor. Commun. ACM 6, 9 (Sept.), 524-544.
50. WISE, D. S. 1993. Stop and one-bit reference counting. Inf. Process. Lett. 46, 5 (July), 243-249.
51. YUASA, T. 1990. Real-time garbage collection on general-purpose machines. J. Softw. Syst. 11, 3, 181-198.
52. ZORN, B. 1990. Barrier methods for garbage collection. Tech. rep. CU-CS-494-90. University of Colorado, Boulder, CO.