Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1991: STACS 91 pp 296–308Cite as

A new compacting garbage-collection algorithm with a good average-case performance

  • Distributed Computing
  • Conference paper
  • First Online:

  • 124 Accesses

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

Abstract

We introduce a new compacting garbage-collection algorithm with a very good averagecase performance. The algorithm combines the advantages of the two most frequently used algorithms for this purpose, mark-sweep and copying algorithms. The algorithm has an average time complexity that is only linear in the number of accessible edges, and it uses only a small amount of extra storage. As a subroutine, we use of a variant of the linear-probing sort algorithm that was presented and analysed by Gonnet and Munro. The distribution of the elements is “better” than uniform, thus we show a lower cost for sorting. We also give a new analysis of the cost of searching an element in the sorted table, since it is needed for the algorithm.

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. Simple Generational Garbage Collection and Fast Allocation. Software-Practice and Experience, 19(2):171–183, February 1989.

    Google Scholar 

  2. Mats Bengtsson. Real-Time Compacting Garbage Collection Algorithms. Licentiate Thesis, September 1990.

    Google Scholar 

  3. Jaques Cohen. Garbage Collection of Linked Data Structures. Computing Surveys, 13(3):341–367, September 1981.

    Article  Google Scholar 

  4. G.H. Gonnet and J.I. Munro. The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform. Journal of Algorithms, XX(5):451–470, 1984.

    Article  Google Scholar 

  5. D. E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley, second edition, 1973. ISBN 0-201-03809-9.

    Google Scholar 

  6. D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, 1973. ISBN 0-201-03803-X.

    Google Scholar 

  7. H. Lieberman and C. Hewitt. A Real-Time Garbage Collector Based on the Lifetimes of Objects. Communications of the ACM, 23(6):419–429, 1983.

    Article  Google Scholar 

  8. D. Ungar. Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm. SIGPLAN Notices, 19(5):157–167, 1984.

    Google Scholar 

  9. Derek A. Zave. A Fast Compacting Garbage Collector. Information Processing Letters, 3(6):167–169, July 1975.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departmento de Ciencias de la Computación, Universidad de Chile, Casilla 2777, Santiago, Chile

    Svante Carlsson, Christer Mattsson & Mats Bengtsson

  2. Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden

    Patricio V. Poblete

Authors
  1. Svante Carlsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christer Mattsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patricio V. Poblete
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mats Bengtsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carlsson, S., Mattsson, C., Poblete, P.V., Bengtsson, M. (1991). A new compacting garbage-collection algorithm with a good average-case performance. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020807

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

  • Online ISBN: 978-3-540-47002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation