Skip to main content
SpringerLink
Log in

Partial Marking GC

  • Conference paper
  • First Online:
Parallel Processing: CONPAR 94 — VAPP VI (VAPP 1994, CONPAR 1994)

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

Abstract

Garbage collection (GC) normally causes pause of execution. Parallel GC has a great potential for real time (non-disruptive) processing. A traditional parallel mark and sweep GC algorithm has, however, well known disadvantages. In this paper, we propose a new GC scheme called Partial Marking GC (PMGC) which is a valiant of generational GC. We implemented a Lisp interpreter with PMGC on a general purpose multi-CPU workstation. As a result, in the best case, PMGC is provided to be twice as efficient as the original algorithm. PMGC is very effective for implementing practical parallel GC.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gabriel, Richard P.: Performance and Evaluation of Lisp systems. The MIT Press (Cambridge, Massachusetts, 1985)

    Google Scholar 

  2. Hickey, T. and Cohen, J.: Perfromance Analysis of On-the-fly garbage collection. Comm. ACM, 27(11) (1984) 1143–1154

    Google Scholar 

  3. Lieberman, H. and Hewitt, C.: A Real-Time Garbage Collector Based on the Life-times of Objects. Comm. ACM, 26(6) (1983) 419–429

    Google Scholar 

  4. Matsui, S. et al.: SYNAPSE: A Multi-micro-processor Lisp Machine with Parallel Garbage Collector. Proceedings of the International Workshop on Parallel Algorithms and Architectures. (Suhl, GDR, 1987) 131–137

    Google Scholar 

  5. Tanaka, Y. and Matsui, S. et al.: Parallel Garbage Collection by Partial Marking and Conditionally Invoked GC. Proceedings of the International Conference on Parallel Computing Technologies, 2, (Obninsk, RUSSIA, 1993) 397–408

    Google Scholar 

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

    Google Scholar 

  7. Wilson, Paul R.: Uniprocessor Garbage Collection Techniques. Lecture Notes in Computer Science 637. Springer-Verlag (1992) 1–42

    Google Scholar 

  8. Yuasa, T.: Real-Time Garbage Collection on General-Purpose Machines. The Journal of Systems and Software 11(3) (1990) 181–198

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Keio University, 223, Yokohama, Japan

    Yoshio Tanaka, Atsushi Maeda & Masakazu Nakanishi

  2. Kanagawa University, 259-12, Hiratsuka, Japan

    Shogo Matsui

Authors
  1. Yoshio Tanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shogo Matsui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Atsushi Maeda
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Masakazu Nakanishi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bruno Buchberger Jens Volkert

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tanaka, Y., Matsui, S., Maeda, A., Nakanishi, M. (1994). Partial Marking GC. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-58430-7_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58430-8

  • Online ISBN: 978-3-540-48789-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation