Resource bounds for self-stabilizing message-driven protocols

Shlomi Dolev, Amos Israeli, Shlomo Moran

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

Abstract

Self-stabilizing message-driven protocols are defined and discussed. The class weak exclusion that contains many natural tasks such as ℓ-exclusion and token passing is defined, and it is shown that in any execution of any self-stabilizing protocol for a task in this class, the configuration size must grow at least in a logarithmic rate. This last lower bound is valid even if the system is supported by a time-out mechanism that prevents communication deadlocks. Then we present three self-stabilizing message-driven protocols for token passing. The rate of growth of configuration size for all protocols matches the aforementioned lower bound. Our protocols are presented for two-processor systems but can be easily adapted to rings of arbitrary size. Our results have an interesting interpretation in terms of automata theory.

Original languageEnglish
Pages (from-to)273-290
Number of pages18
JournalSIAM Journal on Computing
Volume26
Issue number1
DOIs
StatePublished - 1 Jan 1997

Keywords

  • Message passing
  • Self-stabilization
  • Shared memory
  • Token passing

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'Resource bounds for self-stabilizing message-driven protocols'. Together they form a unique fingerprint.

Cite this