Skip to main content

Consistent and Efficient Recovery for Causal Message Logging

  • Conference paper
  • First Online:
Information Networking: Wireless Communications Technologies and Network Applications (ICOIN 2002)

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

Included in the following conference series:

  • 510 Accesses

Abstract

To reduce the number of stable storage accesses and impose no restriction on the execution of live processes during recovery, Elnozahy proposed a recovery algorithm based on causal message logging. However, the algorithm with independent checkpointing may force the system to be in an inconsistent state when processes fail concurrently. In this paper, we identify these inconsistent cases and then present a recovery algorithm to perform consistent recovery by allowing the recovery leader to collect recovery information from the other recovering processes as well as all live ones. Our recovery algorithm requires no additional message compared with Elnozahy’s algorithm.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. E. N. Elnozahy. On the Relevance of Communication Costs of Rollback Recovery Protocols. In Proc. the 15th ACM Symposium on Principles of Distributed Computing, 1995, pp. 74–79.

    Google Scholar 

  2. E. N. Elnozahy, L. Alvisi, Y. M. Wang and D. B. Johnson. A Survey of Rollback-Recovery Protocols in Message-Passing Systems. Technical Report CMU-CS-99-148, Carnegie-Mellon University, 1999.

    Google Scholar 

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

    Article  Google Scholar 

  4. B. Lee, T. Park, H. Y. Yeom and Y. Cho. On the impossibility of non-blocking consistent causal recovery. IEICE Transcations on Information Systems, E83-D(2) (2000) 291–294.

    Google Scholar 

  5. J. R. Mitchell and V. Garg. A non-blocking recovery algorithm for causal message logging. In Proc. of the 17th Symposium on Reliable Ditributed Systems, 1998, pp. 3–9.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ahn, J., Min, SG., Hwang, C. (2002). Consistent and Efficient Recovery for Causal Message Logging. In: Chong, I. (eds) Information Networking: Wireless Communications Technologies and Network Applications. ICOIN 2002. Lecture Notes in Computer Science, vol 2344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45801-8_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-45801-8_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics