Skip to main content
Log in

Handling message semantics with Generic Broadcast protocols

  • Original article
  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary.

Message ordering is a fundamental abstraction in distributed systems. However, ordering guarantees are usually purely “syntactic,” that is, message “semantics” is not taken into consideration despite the fact that in several cases semantic information about messages could be exploited to avoid ordering messages unnecessarily. In this paper we define the Generic Broadcast problem, which orders messages only if needed, based on the semantics of the messages. The semantic information about messages is introduced by conflict relations. We show that Reliable Broadcast and Atomic Broadcast are special instances of Generic Broadcast. The paper also presents two algorithms that solve Generic Broadcast.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: August 2000 / Accepted: August 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pedone, F., Schiper, A. Handling message semantics with Generic Broadcast protocols. Distrib Comput 15, 97–107 (2002). https://doi.org/10.1007/s004460100061

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004460100061

Navigation