Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Memory Management

IWMM 1992: Memory Management pp 440–453Cite as

A concurrent generational garbage collector for a parallel graph reducer

  • Parallelism II
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 637))

Abstract

This paper describes a garbage collector for an implementation of a lazy functional language using parallel graph reduction. The garbage collector is an extension to the Appel-Ellis-Li garbage collector. The extension consists of two parts:

Firstly, generations has been added: this often decreases the garbage collection time with nearly 20%. This shows that generational garbage collection is useful even for a lazy functional language implemented with graph reduction (which performs a lot of updates).

Secondly, the Appel-Ellis-Li garbage collector has been changed so that it cart collect garbage processes (which is essential if we do speculative evaluation).

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrew W. Appel John R. Ellis Kai Li Real-time Concurrent Collection on Stock Multiprocessors. Proceedings of SIGPLAN 88

    Google Scholar 

  2. Andrew W. Appel Simple Generational Garbage Collection and Fast Allocation Software — Practice and experience, volume 19, February 171–183

    Google Scholar 

  3. Lennart Augustsson and Thomas Johnsson Parallel Graph Reduction with the <v,G>-Machine. Proceedings of the 1989 Conference on Functional Languages and Computer Architecture, 202–213, 1989

    Google Scholar 

  4. Lennart Augustsson Garbage Collection in the <v,G>-machine or So much garbage, so little time. PMG memo 73

    Google Scholar 

  5. Paul Hudak and Robert M. Keller Garbage collection and task deletion in distributed applicative processing system. ACM Symposium on LISP and Functional Programming, 167–178, 1982

    Google Scholar 

  6. Paul Hudak Distributed graph marking. Research report 268, Yale University, January 1983

    Google Scholar 

  7. Henry Liberman and Carl Hewit A real-time garbage collector based on the lifetime of objects. Communications of the ACM, 23(6):419–429, 1983

    Article  Google Scholar 

  8. David A. Moon Garbage collection in large LISP system. ACM Symposium on LISP and Functional Programming, 235–246, 1984

    Google Scholar 

  9. Simon L. Peyton Jones The Implementation of Functional Programming Languages Prentice-Hall 1987

    Google Scholar 

  10. David Ungar The Design and Evaluation of a High Performance Smalltalk System. MIT Press 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Chalmers University of Technology, 412 96, Göteborg, Sweden

    Niklas Röjemo

Authors
  1. Niklas Röjemo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yves Bekkers Jacques Cohen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Röjemo, N. (1992). A concurrent generational garbage collector for a parallel graph reducer. In: Bekkers, Y., Cohen, J. (eds) Memory Management. IWMM 1992. Lecture Notes in Computer Science, vol 637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017206

Download citation

  • DOI: https://doi.org/10.1007/BFb0017206

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55940-5

  • Online ISBN: 978-3-540-47315-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation