Skip to main content

Low-Cost Garbage Collection for Causal Message Logging

  • Conference paper
  • First Online:
High Performance Computing — HiPC 2001 (HiPC 2001)

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

Included in the following conference series:

  • 336 Accesses

Abstract

This paper presents two garbage collection schemes for causalmessage logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. The second scheme enables the process to remove a part of log information in its storage if more empty storage space is required after executing the first scheme. It reduces the number of processes to participate in the garbage collection by using the size of the log information of each process. Simulation results show that combining the two schemes significantly reduces the garbage collection overhead compared with the traditional schemes.

This work was supported by University Research Program supported by Ministry of Information and Communication in South Korea under contract 2000-024-01.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahn, J., Min, S., Hwang, C.: Reducing Garbage Collection Overhead in Causal Message Logging. TechnicalReportKU-CSE-01-36, Korea University (2000)

    Google Scholar 

  2. Andrews, G. R.: Paradigms for process interaction in distributed programs. ACM Computing Surveys, Vol. 23. (1991) 49–90

    Article  Google Scholar 

  3. Bagrodia, R., Meyer, R., Takai, M., Chen, Y., Zeng, X., Martin, J., Song, H. Y.: Parsec: A Parallel Simulation Environments for Complex Systems. IEEE Computer, (1998) 77–85

    Google Scholar 

  4. Elnozahy, E. N., Zwaenepoel, W.: Manetho: Transparent rollback-recovery with low overhead, limited rollback and fast output commit. IEEE Transactions on Computers, Vol. 41. (1992) 526–531

    Article  Google Scholar 

  5. Elnozahy, E. N., Alvisi, L., Wang, Y. M., Johnson, D. B.: A Survey of Rollback-Recovery Protocols in Message-Passing Systems. Technical ReportCMU-CS-99-148, Carnegie-Mellon University (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ahn, J., Min, SG., Hwang, C. (2001). Low-Cost Garbage Collection for Causal Message Logging. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2001. HiPC 2001. Lecture Notes in Computer Science, vol 2228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45307-5_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-45307-5_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43009-4

  • Online ISBN: 978-3-540-45307-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics