Smarter garbage collection with simplifiers

Proceedings of the 2006 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, MSPC 2006

Volumn , Issue , 2006, Pages 19-30

  O'Neill, Melissa E ^a   Burton, F Warren ^b  

^a HARVEY MUDD COLLEGE   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Finalizer; Lightweight daemon; Simplifier; Weak pointer

Indexed keywords

ALTERNATIVE MECHANISM; MAINSTREAM SYSTEMS; PROGRAM DATA; TRACING PROCESS;

DATA STRUCTURES; REFUSE DISPOSAL; SYNCHRONIZATION; TRIGGER CIRCUITS;

AD HOC NETWORKS;

EID: 34547540167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1178597.1178601     Document Type: Conference Paper

References (36)

1. O. Agesen, D. Detlefs, and J. E. Moss. Garbage collection and local variable type-precision and liveness in Java virtual machines. In PLDI '98: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, pages 269-279, New York, NY, USA, 1998. ACM Press.
2. B. Alpern, S. Augart, S. M. Blackburn, M. Butrico, A. Cocchi, P. Cheng, J. Dolby, S. Fink, D. Grove, M. Hind, K. S. McKinley, M. Mergen, J. E. B. Moss, T. Ngo, and V. Sarkar. The Jikes research virtual machine project: building an open-source research community. IBM Systems Journal, 44(2):399-417, 2005.
3. S. M. Blackburn, P. Cheng, and K. S. McKinley. Oil and water? High performance garbage collection in Java with MMTk. In ICSE '04: Proceedings of the 26th International Conference on Software Engineering, pages 137-146, Washington, DC, USA, 2004. IEEE Computer Society.
4. A. Bloss. Update analysis and the efficient implementation of functional aggregates. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, Imperial College, London, Sept. 1989. ACM Press.
5. H. J. Boehm. Bounding space usage of conservative garbage collectors. In POPL '02: Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 93-100, New York, NY, USA, 2002. ACM Press.
6. H.-J. Boehm. Destructors, finalizers, and synchronization. In POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 262-272, New York, NY, USA, 2003. ACM Press.
7. H.-J. Boehm and M. Weiser. Garbage collection in an uncooperative environment. Software-Practice and Experience, 18(9):807-820, 1988.
8. G. L. Burn, C. Hankin, and S. Abramsky. Strictness analysis for higher-order functions. Science of Computer Programming, 7(3):249-278, 1986.
9. F. W. Burton. Speculative computation, parallelism, and functional programming. IEEE Transactions on Computers, 34(12):1190-1193, 1985.
10. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, California, Jan. 1977. ACM Press.
11. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, pages 269-282, San Antonio, Texas, Jan. 1979. ACM Press.
12. D. Duchier, L. Kornstaedt, T. Muller, C. Schulte, and P. Van Roy. System modules. Technical Report available in Mozart documentation, available at http://www.mozart-oz.org, 1999.
13. R. K. Dybvig, C. Bruggeman, and D. Eby. Guardians in a generation-based garbage collector. In PLDI '93: Proceedings of the ACM SIGPLAN 1993 Conference on Programming Language Design and Implementation, pages 207-216, New York, NY, USA, 1993. ACM Press.
14. ECMA. Standard ECMA-334: C# Language Specification. ECMA International, Geneva, 3rd edition, June 2005.
15. R. Ennals and S. L. Peyton Jones. Optimistic evaluation: an adaptive evaluation strategy for non-strict programs. In ICFP '03: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pages 287-298, New York, NY, USA, 2003. ACM Press.
16. K.-F. Faxén. Cheap eagerness: Speculative evaluation in a lazy functional language. In ICFP '00: Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming, pages 150-161, New York, NY, USA, 2000. ACM Press.
17. K.-F. Faxén. Dynamic cheap eagerness. In IFL '02: Selected Papers from the 13th International Workshop on Implementation of Functional Languages, pages 105-120, London, UK, 2002. Springer-Verlag.
18. B. Hayes. Finalization in the collector interface. In IWMM '92: Proceedings of the International Workshop on Memory Management, volume 637 of Lecture Notes in Computer Science, pages 277-298, London, UK, 1992. Springer-Verlag.
19. P. R. Hudak and A. Bloss. The aggregate update problem in functional programming systems. In Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, U.S.A., Jan. 1985. ACM Press.
20. S. B. Jones and D. Le Métayer. Compile-time garbage collection by sharing analysis. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pages 54-74, Imperial College, London, Sept. 1989. ACM Press.
21. B. Joy, G. L. Steele, Jr, J. Gosling, and G. Bracha. The Java Language Specification. The Java series. Addison-Wesley, 3nd edition, June 2005.
22. J.-W. Maessen. Eager haskell: Resource-bounded execution yields efficient iteration. In Haskell '02: Proceedings of the 2002 ACM SIGPLAN Workshop on Haskell, pages 38-50, New York, NY, USA, 2002. ACM Press.
23. A. Mycroft. The theory and practice of transforming call-byneed into call-by-value. In Proceedings of the 4th International Symposium on Programming, pages 269-281, London, UK, 1980. Springer-Verlag.
24. A. Mycroft. Abstract Interpretation and Optimising Transformations of Applicative Programs. PhD thesis, Computer Science Department, Edinburgh University, Edinburgh, Scotland, 1981.
25. A. Mycroft and A. Norman. Optimising compilation - lazy functional languages. In SOFSEM '92: Proceedings of the 19th Software Seminar, Bratislava, 1992. INFOSTAT.
26. S. L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall International Series in Computer Science. Prentice Hall, 1987.
27. S. L. Peyton Jones, S. Marlow, and C. Elliott. Stretching the storage manager: Weak pointers and stable names in haskell. In IFL '99: Selected Papers from the 11th International Workshop on Implementation of Functional Languages, pages 37-58, London, UK, 2000. Springer-Verlag.
28. J. Reppy. Asynchronous signals in Standard ML. Technical Report TR 90-1144, Computer Science Department, Cornell University, Ithaca, NY, 1990.
29. R. Shaham, E. K. Kolodner, and M. Sagiv. Heap profiling for space-efficient Java. In PLDI '01: Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, pages 104-113, New York, NY, USA, 2001. ACM Press.
30. R. Shaham, E. K. Kolodner, and M. Sagiv. Estimating the impact of heap liveness information on space consumption in Java. In ISMM '02: Proceedings of the 3rd International Symposium on Memory Management, pages 64-75, New York, NY, USA, 2002. ACM Press.
31. R. Shaham, E. K. Kolodner, and S. Sagiv. Automatic removal of array memory leaks in Java. In CC '00: Proceedings of the 9th International Conference on Compiler Construction, pages 50-66, London, UK, 2000. Springer-Verlag.
32. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2): 215-225, 1975.
33. S. P. Thomas. Garbage collection in shared-environment closure reducers: Space-efficient depth first copying using a tailored approach. Information Processing Letters, 56(1):l-7, Oct. 1995.
34. D. A. Turner. A new implementation technique for applicative languages. Software-Practice and Experience, 9:31-49, 1979.
35. P. Wadler. Fixing some space leaks with a garbage collector. Software - Practice and Experience, 17(9):595-608, 1987.
36. P. Wadler and R. J. M. Hughes. Projections for strictness analysis. In FPCA '89: Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture, pages 385-407, London, UK, 1987. Springer-Verlag.