Self-stabilization of dynamic systems assuming only read/write atomicity

Shlomi Dolev, Amos Israeli, Shlomo Moran

Research output: Contribution to journalArticlepeer-review

171 Scopus citations


Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual-exclusion prootocol for tree structured systems. The second protocol is a spanning tree protocol for systems with any connected communication graph. The thrid protocol is obtianed by use of fair protoco combination, a simple technique which enables the combination of two self-stabilizing dynamic protocols. The result protocol is a self-stabilizing, mutualexclusion protocol for dynamic systems with a general (connected) communication graph. The presented protocols improve upon previous protocols in two ways: First, it is assumed that the only atomic operations are either read or write to the shared memory. Second, our protocols work for any connected network and even for dynamic network, in which the topology of the network may change during the excution.

Original languageEnglish
Pages (from-to)3-16
Number of pages14
JournalDistributed Computing
Issue number1
StatePublished - 1 Nov 1993
Externally publishedYes


  • Protocol combination
  • Read/write atomicity
  • Self-stabllization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'Self-stabilization of dynamic systems assuming only read/write atomicity'. Together they form a unique fingerprint.

Cite this