The Totem single-ring ordering and membership protocol

  • Authors:
  • Y. Amir;L. E. Moser;P. M. Melliar-Smith;D. A. Agarwal;P. Ciarfella

  • Affiliations:
  • Univ. of California, Santa Barbara;Univ. of California, Santa Barbara;Univ. of California, Santa Barbara;Univ. of California, Santa Barbara;Univ. of California, Santa Barbara

  • Venue:
  • ACM Transactions on Computer Systems (TOCS)
  • Year:
  • 1995

Quantified Score

Hi-index 0.02

Visualization

Abstract

Fault-tolerant distributed systems are becoming more important, but in existing systems, maintaining the consistency of replicated data is quite expensive. The Totem single-ring protocol supports consistent concurrent operations by placing a total order on broadcast messages. This total order is derived from the sequence number in a token that circulates around a logical ring imposed on a set of processors in a broadcast domain. The protocol handles reconfiguration of the system when processors fail and restart or when the network partitions and remerges. Extended virtual synchrony ensures that processors deliver messages and configuration changes to the application in a consistent, systemwide total order. An effective flow control mechanism enables the Totem single-ring protocol to achieve message-ordering rates significantly higher than the best prior total-ordering protocols.