Skip to main content

Computing, Observing, Controlling, Checkpointing: Symbiosis Is Even Better Than Agreement!

  • Conference paper
Distributed Computing (DISC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5805))

Included in the following conference series:

  • 746 Accesses

Abstract

This talk is a tribute to Michel Raynal, and more precisely to the nice work I had the great pleasure to share with him during twenty years of close collaboration (1985-2004).

Why this title “Symbiosis is better than Agreement”? Despite the famous FLP (1985) impossibility result, Michel and I often succeeded to reach agreement. Perhaps none of us was faulty? Perhaps our context was not as asynchronous as it could appear? Well, I don’t believe so! The deep reason lies rather in the symbiosis that prevailed between Michel (a tree) and me (a mushroom). This symbiosis not only allowed us to reach agreement, but, more interestingly, to obtain important and fundamental results in several fields of distributed computing. From “old” problems or paradigms - e.g. Network traversal, Detection of stable properties, Election of a leader,Mutual exclusion, Distributed evaluation - to advances in new ones - e.g., related to fault tolerance such as Checkpointing -, we have always strived to bring out design principles and to obtain generic solutions.

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

References

  1. Helary, J.M., Raynal, M.: Towards the construction of Distributed Detection Programs, with an application to distributed termination. Dist. Comp. 7(3), 137–147 (1994)

    Article  Google Scholar 

  2. Helary, J.M., Mostefaoui, A., Raynal, M.: Interval Consistency of Asynchronous Distributed Computations. Journal of Computer and System Sciences (JCSS) 64(2), 329–349 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hélary, JM. (2009). Computing, Observing, Controlling, Checkpointing: Symbiosis Is Even Better Than Agreement!. In: Keidar, I. (eds) Distributed Computing. DISC 2009. Lecture Notes in Computer Science, vol 5805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04355-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04355-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04354-3

  • Online ISBN: 978-3-642-04355-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics