Message analysis-guided allocation and low-pause incremental garbage collection in a concurrent language

International Symposium on Memory Management, ISMM

Volumn , Issue , 2004, Pages 1-12

  Sagonas, Konstantinos ^a   Wilhelmsson, Jesper ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Concurrent languages; Erlang; Incremental and real time garbage collection; Thread local heaps

Indexed keywords

COMPUTER ARCHITECTURE; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS; SEMANTICS; SERVERS; STORAGE ALLOCATION (COMPUTER); SYNCHRONIZATION; TELECOMMUNICATION;

CONCURRENT LANGUAGES; DYNAMIC CODE REPLACEMENT; ERLANG; INCREMENTAL AND REAL-TIME GARBAGE COLLECTION; MESSAGE ANALYSIS; OPEN TELECOM PLATFORM (OTP); STATIC ANALYSIS; THREAD-LOCAL HEAPS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 21644466803     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1029873.1029875     Document Type: Conference Paper

References (25)

1. J. Armstrong and R. Virding. One pass real-time generational mark-sweep garbage collection. In H. G. Baker, editor, Proceedings of IWMM'95: International Workshop on Memory Management, number 986 in LNCS, pages 313-322. Springer-Verlag, Sept. 1995.
2. J. Armstrong, R. Virding, C. Wikström, and M. Williams. Concurrent Programming in Erlang. Prentice Hall Europe, Herfordshire, Great Britain, second edition, 1996.
3. D. F. Bacon, P. Cheng, and V. T. Rajan. A real-time garbage collector with low overhead and consistent utilization. In Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 285-298, New York, N.Y., Jan. 2003. ACM Press.
4. B. Blanchet. Escape analysis for Java™: Theory and practice. ACM Trans. Prog. Lang. Syst., 25(6):713-775, Nov. 2003.
5. R. A. Brooks. Trading data space for reduced time and code space in real-time garbage collection on stock hardware. In G. L. Steele, editor, Proceedings of the 1984 ACM Symposium on LISP and Functional Programming, pages 256-262, New York, N.Y., 1984. ACM Press.
6. R. Carlsson, K. Sagonas, and J. Wilhelmsson. Message analysis for concurrent languages. In R. Cousot, editor, Static Analysis: Proceedings of the 10th International Symposium, number 2694 in LNCS, pages 73-90, Berlin, Germany, June 2003. Springer.
7. C. J. Cheney. A nonrecursive list compacting algorithm. Communications of the ACM, 13(11):677-678, Nov. 1970.
8. P. Cheng and G. E. Blelloch. A parallel, real-time garbage collector. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 125-136, New York, N.Y., June 2001. ACM Press.
9. P. Cheng, R. Harper, and P. Lee. Generational stack collection and profile-driven pretenuring. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI'98, pages 162-173, New York, N.Y., 1998. ACM Press.
10. J.-D. Choi, M. Gupta, M. Serrano, V. C. Shreedhar, and S. P. Midkiff. Stack allocation and synchronization optimizations for Java using escape analysis. ACM Trans. Prog. Lang. Syst., 25(6):876-910, Nov. 2003.
11. G. E. Collins. A method for overlapping and erasure of lists. Communications of the ACM, 3(12):655-657, Dec. 1960.
12. D. Doligez and X. Leroy. A concurrent, generational garbage collector for a multithreaded implementation of ML. In Conference Record of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 113-123, New York, N.Y., Jan. 1993. ACM Press.
13. T. Domani, G. Goldshtein, E. Kolodner, E. Lewis, E. Petrank, and D. Sheinwald. Thread-local heaps for Java. In D. Detlefs, editor, Proceedings of ISMM'2002: ACM SIGPLAN International Symposium on Memory Management, pages 76-87, New York, N.Y., June 2002. ACM Press.
14. M. Feeley and M. Larose. A compacting incremental collector and its performance in a production quality compiler. In Proceedings of ISMM'98: ACM SIGPLAN International Symposium on Memory Management, pages 1-9, New York, N.Y., Oct. 1998. ACM Press.
15. L. Huelsbergen and J. R. Larus. A concurrent copying garbage collector for languages that distinguish (im)mutable data. In Proceedings of the 4th ACM Symposium on Principles and Practice of Parallel Programming, pages 73-82, New York, N.Y., May 1993. ACM Press.
16. E. Johansson, M. Pettersson, and K. Sagonas. HiPE: A High Performance Erlang system. In Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pages 32-43, New York, NY, Sept. 2000. ACM Press.
17. E. Johansson, K. Sagonas, and J. Wilhelmsson. Heap architectures for concurrent languages using message passing. In D. Detlefs, editor, Proceedings of ISMM'2002: ACM SIGPLAN International Symposium on Memory Management, pages 88-99, New York, N.Y., June 2002. ACM Press.
18. R. E. Jones and R. Lins. Garbage Collection: Algorithms for automatic memory management. John Wiley & Sons, 1996.
19. D. Mosberger and T. Jin. httperf - a tool for measuring web server performance. SIGMETRICS Perform. Eval. Rev., 26(3):31-37, Dec. 1998.
20. S. Nettles and J. O'Toole. Real-time replication garbage collection. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 217-226, New York, N.Y, June 1993. ACM Press.
21. M. Pettersson. Linux x86 performance-monitoring counters driver, http://user.it.uu.se/~mikpe/linux/perfctr/.
22. E. Ruf. Effective synchronization removal for Java. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, pages 208-218, New York, N.Y., June 2000. ACM Press.
23. B. Steensgaard. Thread-specific heaps for multi-threaded programs. In Proceedings of the ACM SIGPLAN International Symposium on Memory Management, pages 18-24, New York, N.Y., Oct. 2000. ACM Press.
24. L. Stein and D. MacEachern. Writing Apache Modules with Perl and C. O'Reilly & Associates, 1999.
25. P. R. Wilson. Uniprocessor garbage collection techniques. In Y. Bekkers and J. Cohen, editors, Proceedings of IWMM'92: International Workshop on Memory Management, number 637 in LNCS, pages 1-42, Berlin, Germany, Sept. 1992. Springer-Verlag. See also expanded version as Univ. of Texas Austin technical report submitted to ACM Computing Surveys.