Skip to main content

Consistent Lamport Clocks for Asynchronous Groups with Process Crashes

  • Conference paper
  • First Online:

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

Abstract

Process duplication is a classical method to cope with pro- cess crashes: a set of replicated processes constitutes a group that imple- ments some fault-tolerant service. Several distributed systems are struc- tured as a set of interacting reliable groups.

This paper presents a clock management protocol where a logical clock is associated with each group (usually, logical clocks are associated with processes). The main problem that has to be solved is to ensure that all processes of a group behave in the same manner despite non-deterministic statements. It is shown that this problem can be reduced to the consensus problem. So, the proposed group clock protocol is based on an underlying building block providing a solution to the consensus problem.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Birman and T. Joseph. Reliable Communication in the Presence of Failures, ACM Trans. on Comp. Syst., 5(1):47–76, 1987.

    Article  Google Scholar 

  2. Chandra T., Hadzilacos V. and Toueg S. The Weakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4):685–722, July 1996 (A preliminary version appeared in Proc. of the 11th ACM Symp. PODC, pp. 147-158, 1992).

    Article  MATH  MathSciNet  Google Scholar 

  3. Chandra T. and Toueg S. Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(1):225–267, March 1996 (A preliminary version appeared in Proc. of the 10th ACM Symp. PODC, pp. 325-340, 1991).

    Article  MATH  MathSciNet  Google Scholar 

  4. Fidge C. J. Logical Time in Distributed Computing Systems. IEEE Computer, 24(8):11–76, 1991.

    Google Scholar 

  5. Fischer M. J., Lynch N. and Paterson M. S. Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374–382, April 1985.

    Article  MATH  MathSciNet  Google Scholar 

  6. Hadzilacos V. and Toueg S. Reliable Broadcast and Related Problems. In Distributed Systems (Second Edition), ACM Press (S. Mullender Ed.), New-York, 1993, pp. 97–145.

    Google Scholar 

  7. Hurfin M. and Raynal M. A Simple and Fast Asynchronous Consensus Protocol Based on aWeak Failure Detector. Distributed Computing, to appear, 12(4), 1999.

    Google Scholar 

  8. Lamport, L. Time Clocks and the Ordering of Events in a Distributed System, Communications of the ACM, 21(7):558–565, 1978.

    Article  MATH  Google Scholar 

  9. Mattern, F. Virtual Time and Global States of Distributed Systems. In Cosnard et al. Eds, Proc. of the Int. Workshop on Parallel and Distributed Algorithms, France, 1988, pp. 215–226, Elsevier Science Publishers B. V., North Holland, 1989.

    Google Scholar 

  10. Powell D. (Guest Editor). Special issue on Group Communication. Communications of the ACM, Vol. 39(4), April 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mostéfaoui, A., Raynal, M., Takizawa, M. (1999). Consistent Lamport Clocks for Asynchronous Groups with Process Crashes. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-48387-X_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48387-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics