Exploring the barrier to entry - Incremental generational garbage collection for Haskell

International Symposium on Memory Management, ISMM

Volumn , Issue , 2004, Pages 163-174

  Cheadle, A M ^a   Field, A J ^a   Marlow, S ^b   Jones, S L Peyton ^b   While, R L ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b MICROSOFT RESEARCH   (United Kingdom)

^c UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Intermental garbage collection; Non stop Haskell

Indexed keywords

INCREMENTAL GARBAGE COLLECTION; NON-STOP HASKELL; OBJECT PROMOTION; SINGLE-GENERATION HEAP;

ALGORITHMS; BENCHMARKING; CONTROL SYSTEMS; FUNCTIONS; MATHEMATICAL MODELS; REAL TIME SYSTEMS;

OBJECT ORIENTED PROGRAMMING;

EID: 21644448227     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A. Appel. Simple Generational Garbage Collector and Fast Allocation. Software Practice and Experience, 19(2), pages 171-83, 1989.
2. H. Baker. List-processing in real-time on a serial computer. In CACM 21(4), pages 280-94, 1978.
3. D.F. Bacon, P. Cheng, and V.T. Rajan. A Real-time Garbage Collector with Low Overhead and Consistent Utilization In ACM SIGPLAN Symposium on Principles of Programming Languages , pages 285-98, 2003.
4. G. Blelloch and P. Cheng. On bounding time and space for multiprocessor garbage collection. In ACM SIGPLAN Symposium on Programming Language Design and Implementation, pages 104-17, 1999.
5. P. Cheng and G. Blelloch. A parallel, real-time garbage collector. In ACM SIGPLAN Symposium on Programming Language Design and Implementation, pages 125-36, 2001.
6. G. Burn, S. Peyton-Jones, and J. Robson. The spineless g-machine. In Conference on Lisp and Functional Programming, pages 244-58, 1988.
7. A.M. Cheadle, A.J. Field, S. Marlow, S.L. Peyton Jones, and R.L. While. Non-stop Haskell In International Conference on Functional Programming, pages 257-67, 2000.
8. C. Cheney. A non-recursive list compacting algorithm. In CACM 13(11), pages 677-8, 1970.
9. J. DeTreville. Experience with conncurrent garbage collectors for Modula-2+. Technical Report 64, DEC Systems Research Center, Palo Alto, CA, August 1990.
10. B. Hayes. Using key object opportunism to collect old objects. In Conference on Object-Oriented Programming, Systems, Languages, and Applications , pages 33-46, 1991.
11. S. Marlow and S. Peyton Jones Making a Fast Curry -Push/enter vs eval/apply for higher-order languages Submitted to International Conference on Functional Programming, 2004
12. J.W. Maessen Hybrid Eager and Lazy Evaluation for the Efficient Compilation of Haskell PhD thesis, Massachusetts Institute of Technology, USA, 2002
13. S.M. Nettles, J.W. O'Toole, D. Pierce and N. Haines. Replication-based incremental copying collection. In Proceedings of the International Workshop on Memory Management, LNCS 637. Springer Verlag, pages 357-64, 1992.
14. W. Partain. The nofib Benchmark Suite of Haskell Programs. Dept. of Computer Science, University of Glasgow, 1993.
15. PAPI: Performance Application Programming Interface http://icl.cs.utk.edu/papi/
16. N. Rojemo. Generational Garbage Collection for Lazy Functional Languages Without Temporary Space Leaks Memory Management Workshop, pages 145-62, 1995. ftp://ftp.cs.chalmers.se/pub/users/rojemo/iwmm95.ps.gz
17. P.M. Sansom and S.L. Peyton Jones. Generational garbage collection for Haskell In Proceedings of the ACM conference on Functional Programming Languages and Computer Architecture, pages 106-16, June 1993
18. S. Peyton Jones. The Spineless Tagless g-machine: Second attempt. In Workshop on the Parallel Implementation of Functional Languages, volume CSTR 91-07, pages 147-91. University of Southampton, 1991.
19. S. Peyton Jones. Implementing lazy functional languages on stock hardware: the Spineless Tagless g-machine. In Journal of Functional Programming, pages 127-202, 1992.
20. S. Peyton Jones, S. Marlow, and A. Reid. The STG runtime system (revised). Draft paper, Microsoft Research Ltd, 1999.
21. S. Peyton Jones and J. Salkild. The Spineless Tagless G-machine. In Conference on Functional Programming Languages and Computer Architecture, pages 184-201, 1989.
22. J. Seward. Generational Garbage Collection for Lazy Graph Reduction. In International Workshop on Memory Management, pages 200-17, 1992.
23. R.A. Shaw. Improving garbage collector performance in virtual memory. Technical Report CSL-TR-87-323, Stanford University, March 1987.
24. D.M. Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm, In ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pages 157-67, April 1984.
25. Valgrind, an open-source memory debugger for x86-linux. http://valgrind.kde.org.
26. B. Zorn. Comparative Performance Evaluation of Garbage Collection Algorithms. PhD thesis, University of California at Berkeley, 1989.
27. B. Zorn. The measured cost of conservative garbage collection. In Software Practice and Experience, volume 23, pages 733-56, 1993.