Skip to main content
SpringerLink
Log in

Practical Impact of Group Communication Theory

  • Chapter
  • First Online:
Future Directions in Distributed Computing

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

Abstract

Group communication is nowadays a well established topic in distributed computing. It emerged over the years as a topic with a strong synergy between theory and practice: group communication is highly relevant for building distributed systems, and is also of theoretical importance, because of the difficult problems it addresses. The paper presents an - inevitably subjective - retrospective of the main milestones that led to our current understanding of group communication, with the focus on theoretical contributions of practical relevance. Some open issues are discussed at the end of the paper.

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

Access this chapter

Log in via an institution
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. A. El Abbadi and S. Toueg. Availability in Partitioned Replicated Databases. In ACM SIGACT-SIGMOD symp. on prin. of Database Systems, pages 240–251, March 1986. See also ACM Trans. on Database Systems, 14(2):264–290, June 1989.

    Google Scholar 

  2. M. Aguilera, W. Chen, and S. Toueg. Failure detection and consensus in the crash-recovery model. In Proceedings of the 12th International Symposium on Distributed Computing, LNCS, pages 231–245. Springer, September 1998.

    Google Scholar 

  3. Y. Amir, D. Dolev, S. Kramer, and D. Malki. Membership Algorithms for Multicast Communication Groups. In 6th Intl. Workshop on Distributed Algorithms proceedings (WDAG-6), (itlcns, 647), pages 292–312, November 1992.

    Google Scholar 

  4. E. Anceaume, B. Charron-Bost, P. Minet, and S. Toueg. On the formal specification of group membership services. Technical Report 95-1534, Department of Computer Science, Cornell University, August 1995.

    Google Scholar 

  5. M. Barborak, M. Malek, and A. Dahbura. The Consensus Problem in Fault-Tolerant Computing. ACM Computing Surveys, 25(2):171–220, June 1993.

    Article  Google Scholar 

  6. M. Ben-Or. Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In proc. 2nd annual ACM Symposium on Principles of Distributed Computing, pages 27–30, 1983.

    Google Scholar 

  7. K. Birman and T. Joseph. Reliable Communication in the Presence of Failures. ACMTrans. on Computer Systems, 5(1):47–76, February 1987.

    Article  Google Scholar 

  8. K. Birman and T. Joseph. Exploiting Virtual Synchrony in Distributed Systems. In 11th Ann. Symp. Operating Systems Principles, pages 123–138. ACM, Nov 1987.

    Google Scholar 

  9. K. Birman, T. Joseph, T. Räuchle, and A. ElAbbadi. Implementing Fault-Tolerant Distributed Objects. IEEE Trans. on Software Engineering, 11(6):502–508, June 1985.

    Article  Google Scholar 

  10. T. D. Chandra, V. Hadzilacos, and S. Toueg. The Weakest Failure Detector for Solving Consensus. Journal of ACM, 43(4):685–722, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  11. T. D. Chandra and S. Toueg. Unreliable Failure Detectors for Asynchronous Systems. In proc. 10th annual ACMSymposium on Principles of Distributed Computing, pages 325–340, 1991. See also Journal of the ACM, 43(2):225–267, 1996.

    Google Scholar 

  12. Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg, and Bernadette Charron-Bost. On the impossibility of group membership. In Proc. of the 15th ACM Symposium on Principles of Distributed Computing, pages 322–330, Philadelphia, Pennsylvania, USA, May 1996.

    Google Scholar 

  13. J-M. Chang. Simplifying Distributed Database Systems Design by Using a Broadcast Network. In Proc. of the ACM SIGMOD Int. Conference on Management of Data, pages 223–233, June 1984.

    Google Scholar 

  14. J. M._Chang and N. Maxemchuck. Reliable Broadcast Protocols. ACM Trans. on Computer Systems, 2(3):251–273, August 1984.

    Article  Google Scholar 

  15. B. Charron-Bost, X. Défago, and A. Schiper. Broadcasting Messages in Fault-Tolerant Distributed Systems: the benefit of handling input-triggered and output-triggered suspicions differently. In 21st IEEE Symp. on Reliable Distributed Systems (SRDS-21), pages 244–249, Osaka, Japan, October 2002.

    Google Scholar 

  16. D. R. Cheriton and D. Skeen. Understanding the Limitations of Causally and Totally Ordered Communications. In 14th ACM Symp. Operating Systems Principles, pages 44–57, Dec 1993.

    Google Scholar 

  17. D. R. Cheriton and W. Zwaenepoel. Distributed Process Groups in the V Kernel. ACM Trans. on Computer Systems, 2(3):77–107, May 1985.

    Article  Google Scholar 

  18. G.V. Chockler, I. Keidar, and R. Vitenberg. Group Communication Specifications: A Comprehensive Study. ACM Computing Surveys, 4(33):1–43, December 2001.

    Google Scholar 

  19. F. Cristian, H. Aghili, R. Strong, and D. Dolev. Atomic broadcast: From simple message diffusion to byzantine agreement. In IEEE 15th Int Symp on Fault-Tolerant Computing (FTCS-15), pages 200–206, June 1985.

    Google Scholar 

  20. Flaviu Cristian. Reaching Agreement on Processor Group Membership in Synchronous Distributed Systems. Distributed Computing, 4(4):175–187, April 1991.

    Article  MATH  Google Scholar 

  21. D. Davcec and A. Burkhard. Consistency and Recovery Control for Replicated Files. In Proceedings of the 10th Symposium on Operating Systems Principles, pages 87–96, 1985.

    Google Scholar 

  22. X. Défago, A. Schiper, and P. Urban. Totally Ordered Broadcast and Multicast Algorithms:A Comprehensive Survey. TR DSC/2000/036, EPFL, Communication Systems Departement, October 2000.

    Google Scholar 

  23. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288–323, April 1988.

    Article  MathSciNet  Google Scholar 

  24. A. Fekete, N. Lynch, and A.A. Shvartsman. Specifying and Using a Group Communication Service. ACM Trans. on Computer Systems, 19(2):171–216, May 2001.

    Article  Google Scholar 

  25. M. Fischer. The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). In Int. Conf. on Foundations of Computation Theory (FCT), pages 127–140, 1983.

    Google Scholar 

  26. M. Fischer, N. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. Journal of ACM, 32:374–382, April 1985.

    Google Scholar 

  27. V. Hadzilacos and S. Toueg. Fault-Tolerant Broadcasts and Related Problems. Technical Report 94-1425, Department of Computer Science, Cornell University, May 1994.

    Google Scholar 

  28. B. Kemme. Database Replication for Clusters of Workstations. PhD thesis, ETH Zurich, Switzerland, 2000. Number 13864.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  30. L. Lamport. Using Time Instead of Timeout for Fault-Tolerant Distributed Systems. ACM Trans. on Progr. Languages and Syst., 6(2):254–280, April 1984.

    Article  Google Scholar 

  31. L. Lamport. The Part-Time Parliament. Technical Report 49, Digital SRC, September 1989. See also ACM Trans. on Computer Systems, 16(2):133–169, May 1998.

    Google Scholar 

  32. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Trans. on Progr. Languages and Syst., 4(3):382–401, July 1982.

    Article  MATH  Google Scholar 

  33. D. Malkhi and M. Reiter. Byzantine Quorum Systems. Distributed Computing, 11(4):203–213, 1998.

    Article  MATH  Google Scholar 

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

    Google Scholar 

  35. M. Pease, R. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults. Journal of ACM, 27(2):228–234, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  36. F. Pedone. The Database State Machine and Group Communication Issues. PhD thesis, École Polytechnique Fédérale de Lausanne, Switzerland, December 1999. Number 2090.

    Google Scholar 

  37. F. Pedone and A. Schiper. Generic Broadcast. In 13th. Intl. Symposium on Distributed Computing (DISC’99), pages 94–108. Springer Verlag, LNCS 1693, September 1999.

    Google Scholar 

  38. M. Rabin. Randomized Byzantine Generals. In Proc. 24th Annual ACM Symposium on Foundations of Computer Science, pages 403–409, 1983.

    Google Scholar 

  39. R. Reischuk. A New Solution for the Byzantine general’s problem. Technical Report RJ 3673, IBM Research Laboratory, November 1982.

    Google Scholar 

  40. A. M. Ricciardi and K. P. Birman. Using Process Groups to Implement Failure Detection in Asynchronous Environments. In Proc. of the 10th ACM Symposium on Principles of Distributed Computing, pages 341–352, August 1991.

    Google Scholar 

  41. F.B. Schneider. Synchronization in Distributed Programs. ACM Trans. on Progr. Languages and Syst., 4(2):125–148, April 1982.

    Article  MATH  Google Scholar 

  42. R.D. Schlichting and F.B. Schneider. Fail-stop processors: an approach to designing faulttolerant computing systems. ACM Trans. on Computer Systems, 1(3):222–238, August 1983.

    Article  Google Scholar 

  43. J.H. Wensley. SIFT-Software Implementated Fault Tolerance. FJCC, pages 243–253, 1972.

    Google Scholar 

  44. J.H. Wensley, L. Lamport, J. Goldberg, M.W. Green, K.N. Levitt, P.M. Melliar-Smith, R.E. Shotak, and C.B. Weinstock. SIFT: The Design and Analysis of a Fault-Tolerant Computer for Aircraft Control. Proc. IEEE, 66(10):1240–1255, 1978.

    Google Scholar 

  45. M. Wiesmann. Group Communications and Database Replication: Techniques, Issues and Performance. PhD thesis, École Polytechnique Fédérale de Lausanne, Switzerland, 2002. Number 2577.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole Polytechnique Fédérale de Lausanne (EPFL), 1015, Lausanne, Switzerland

    André Schiper

Authors
  1. André Schiper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculté Informatique et Communication, École Polytechnique Fédérale de Lausanne, IN-Ecublens, 1015, Lausanne, Switzerland

    André Schiper

  2. Computer Science and Engineering, University of Connecticut, Unit 3155, 06269, Storrs, CT, USA

    Alex A. Shvartsman

  3. Computer Science Division, University of California at Berkeley, 447/443 Soda Hall, 94704-1776, Berkeley, CA, USA

    Hakim Weatherspoon  & Ben Y. Zhao  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Schiper, A. (2003). Practical Impact of Group Communication Theory. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds) Future Directions in Distributed Computing. Lecture Notes in Computer Science, vol 2584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37795-6_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-37795-6_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00912-2

  • Online ISBN: 978-3-540-37795-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation