Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Distributed Computing

DISC 2000: Distributed Computing pp 268–282Cite as

Thrifty Generic Broadcast

  • Conference paper
  • First Online:

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

Abstract

We consider the problem of generic broadcast in asynchronous systems with crashes, a problem that was first studied in [12]. Roughly speaking, given a “conflict” relation on the set of messages, generic broad- cast ensures that any two messages that conflict are delivered in the same order; messages that do not conflict may be delivered in different order. In this paper, we define what it means for an implementation generic broadcast to be “thrifty”, and give corresponding implementations that are optimal in terms of resiliency. We also give an interesting application of our results regarding the implementation of atomic broadcast.

Research partially supported by NSF grants CCR-9711403.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Thrifty generic broadcast. Technical Report (to appear), DIX, école Polytechnique, Palaiseau, France, 2000.

    Google Scholar 

  2. G. Alvarez, F. Cristian, and S. Mishra. On-demand fault-tolerant atomic broadcast protocol. In Proceedings of the Fifth IFIP International Conference on Dependable Computing for Critical Applications, Sept. 1995.

    Google Scholar 

  3. Y. Amir, P. Moser, L. E. Melliar-Smith, D. Agarwal, and P. Ciarfella. The totem single-ring ordering and membership protocol. ACM Trans. Comput. Syst., 13(4):311–342, Nov. 1995.

    Article  Google Scholar 

  4. K. P. Birman and T. A. Joseph. Reliable communication in the presence of failures. ACM Trans. Comput. Syst., 5(l):47–76, Feb. 1987.

    Article  Google Scholar 

  5. T. D. Chandra and S. Toueg. Unreliable failure detectors for asynchronous systems. J. ACM, 43(2):225–267, Mar. 1996.

    Article  MATH  MathSciNet  Google Scholar 

  6. W. Chen, S. Toueg, and M. K. Aguilera. On the quality of service of failure detectors. In Proceedings of the First International Conference on Dependable Systems and Networks (also FTCS-30), June 2000.

    Google Scholar 

  7. F. Cristian, H. Aghili, H. R. Strong, and D. Dolev. Atomic broadcast: From simple message diffusion to Byzantine agreement. In Proceedings of the Fifteenth International Symposium on Fault-Tolerant Computing, pages 200–206, June 1985.

    Google Scholar 

  8. D. Dolev, S. Kramer, and D. Malki. Early delivery totally ordered multicast in asynchronous environment. In IEEE Proceedings of the 23th International Symp on Fault-tolerant computing (FTCS-23), pages 544–553, June 1993.

    Google Scholar 

  9. A. Gopal, R. Strong, S. Toueg, and F. Cristian. Early-delivery atomic broadcast (extended abstract). In Proceedings of the Ninth ACM Symposium on Principles of Distributed Computing, pages 297–309, Aug. 1990.

    Google Scholar 

  10. V. Hadzilacos and S. Toueg. A modular approach to fault-tolerant broadcasts and related problems. Technical Report TR 94-1425, Cornell University, Dept. of Computer Science, Cornell University, Ithaca, NY 14853, May 1994.

    Google Scholar 

  11. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558–565, July 1978.

    Article  MATH  Google Scholar 

  12. F. Pedone and A. Schiper. Generic broadcast. In Proceedings of the 13th Interna-tional Symposium on Distributed Computing (DISC’99, formerly WDAG), Sept. 1999.

    Google Scholar 

  13. F. Pedone and A. Schiper. Generic broadcast. Technical Report SSC/1999/012, école Polytechnique Fédérale de Lausanne, Switzerland, Apr. 1999.

    Google Scholar 

  14. R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. In Proceedings of Middleware’98, Sept. 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIX, école Polytechnique, 91128, Palaiseau Cedex, France

    Marcos Kawazoe Aguilera & Sam Toueg

  2. LIAFA, Université D. Diderot, 2 Place Jussieu, 75251, Paris, Cedex 05, France

    Carole Delporte-Gallet & Hugues Fauconnier

Authors
  1. Marcos Kawazoe Aguilera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carole Delporte-Gallet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hugues Fauconnier
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sam Toueg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912, USA

    Maurice Herlihy

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kawazoe Aguilera, M., Delporte-Gallet, C., Fauconnier, H., Toueg, S. (2000). Thrifty Generic Broadcast. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-40026-5_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41143-7

  • Online ISBN: 978-3-540-40026-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation