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

  • Authors:

  • Shlomi Dolev;Amos Israeli;Shlomo Moran

  • Affiliations:

  • Department of Computer Science, Technion - Israel Institute of Technology, Haifa 32000, Israel;Department of Electrical Engineering, Technion - Israel Institute of Technology, Haifa 32000, Israel;Department of Computer Science, Technion - Israel Institute of Technology, Haifa 32000, Israel

  • Venue:
  • Distributed Computing - Special issue: Self-stabilization
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual-exclusion protocol for tree structured systems. The second protocol is a spanning tree protocol for systems with any connected communication graph. The third protocol is obtained by use of fair protocol combination, a simple technique which enables the combination of two self-stabilizing dynamic protocols. The result protocol is a self-stabilizing, mutual-exclusion 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 networks, in which the topology of the network may change during the execution.