Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A hierarchical membership protocol for synchronous distributed systems

  • Session 13: Distributed systems
  • Conference paper
  • First Online:
Dependable Computing — EDCC-1 (EDCC 1994)

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

Included in the following conference series:

Abstract

A membership service for a synchronous distributed computer system is described. The system is assumed to be composed of groups in which a relatively frequent message exchange occurs. A hierarchy of connected groups constitutes a connected network. The membership service protocol reflects this hierarchical structure. The protocol tolerates timing, omission and crash failures. Time-bounds are specified in which additions (removals) of processors to (from) the system are known to all participating processors.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. Altaber, P.G. Innocenti, and R. Rausch. Multiprocessor architecture for the LEP storage ring. In 6th Annual Workshop on Distributed Computer Control Systems, Monterey, May 1985. IFAC.

    Google Scholar 

  2. Committee Arinc 651. ARINC report 651, draft 9. Technical Report 91-207/SAI-435, Airlines Electronic Engineering Committee, September 1991.

    Google Scholar 

  3. D. Alstein and P.D.V. van der Stok. Hard Real-Time Reliable Multicast in the DEDOS system. In Third International Workshop on Responsive Computer Systems, Lincoln, New Hampshire, September 1993.

    Google Scholar 

  4. K.P. Birman and T.A. Joseph. Reliable communication in the presence of failures. ACM Transactions on Computers, 5(1):47–76, February 1987.

    Article  Google Scholar 

  5. F. Cristian. Atomic Broadcast: From simple message Diffusion to Byzantine Agreement. In Proceedings 15th International Symposium on Fault-Tolerant Computing, pages 200–206. Ann Arbor,MI, June 1985.

    Google Scholar 

  6. F. Cristian. Agreeing on who is present and who is absent in a synchronous distributed system. In Proceedings 18th International Symposium on Fault-Tolerant Computing, pages 206–211, Tokyo,Japan, June 1988.

    Google Scholar 

  7. F. Cristian. Synchronous Atomic Broadcast for Redundant Broadcast Channels. Journal of Real-Time Systems, 2:195–212, 1990.

    Article  Google Scholar 

  8. R. de Lemos and P.D. Ezhilchelvan. Agreement on the Group Membership in Synchronous Distributed Systems. In Distributed Algorithms, Proceedings of Workshop on Distributed Algorithms '90, pages 353–372. Springer verlag, June 1990.

    Google Scholar 

  9. P.D. Ezhilchelvan and R. de Lemos. A robust group membership algorithm for distributed real-time systems. In proc. 11th Real-Time Systems Symposium, pages 173–179, Lake Buena Vista, Florida, December 1990. IEEE.

    Google Scholar 

  10. V. Hadzilacos and S. Toueg. Fault-Tolerant Broadcasts and Related problems. In S. Mullender, editor, Distributed Systems, pages 97–145, 1993.

    Google Scholar 

  11. H. Kopetz, G. Grünsteidl, and J. Reisinger. Fault-Tolerant Membership Algorithm for Distributed Real-Time Systems. In International Working Conference on Dependable Computing for Critical Applications, pages 167–174, Santa Barbara, CA, August 1989.

    Google Scholar 

  12. E.J. Luit and J.M.M. Martin. A Convergence Function for Clock Synchronization Protocols. In Proceedings of the 2nd Workshop on Parallel and Distributed Real-Time Systems, Cancun, Mexico, 1994. IEEE.

    Google Scholar 

  13. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):256–280, July 1982.

    Article  Google Scholar 

  14. L.E. Moser, P.M. Melliar-Smith, and V. Agrawala. Membership Algorithms for Asynchronous Distributed Systems. In 11th International Conference on Distributed Computing, pages 480–488. IEEE, May 1991.

    Google Scholar 

  15. P.M. Melliar-Smith, L.E. Moser, and V. Agrawala. Broadcast Protocols for distributed systems. IEEE Transactions on Parallel and Distributed Systems, 1(1):17–25, January 1990.

    Article  Google Scholar 

  16. Y. Moses and M. Tuttle. Programming simultaneous actions using common knowledge. Algorithmica, 3:249–259, 1988.

    Article  Google Scholar 

  17. P.D.V. van der Stok. DLX, The Multiprocessor Assembly for LEP/SPS Controls. In Europhysics Conference on Control Systems for Experimental Physics, pages 152–154, Villars-sur-Ollon, Switzerland, September/October 1987. CERN, Geneva.

    Google Scholar 

  18. P.D.V. van der Stok, M.M.M.P.J. Claessen, and D. Alstein. Hierarchical membership protocol for synchronous distributed systems. Technical Report CSN 93/40, Eindhoven University of Technology, available on request from authors, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Klaus Echtle Dieter Hammer David Powell

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van der Stok, P.D.V., Claessen, M.M.M.P.J., Alstein, D. (1994). A hierarchical membership protocol for synchronous distributed systems. In: Echtle, K., Hammer, D., Powell, D. (eds) Dependable Computing — EDCC-1. EDCC 1994. Lecture Notes in Computer Science, vol 852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58426-9_160

Download citation

  • DOI: https://doi.org/10.1007/3-540-58426-9_160

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58426-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics