A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments

DOI10.1016/S0020-0190(98)00069-6zbMath0925.68203MaRDI QIDQ1274286

Masaaki Mizuno, Mikhail V. Nesterenko

Publication date: 12 January 1999

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Parallel algorithmsFault toleranceConcurrencySelf-stabilization

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (9)

Alternators in read/write atomicity ⋮ Distributed edge coloration for bipartite networks ⋮ A self-stabilizing algorithm for the st-order problem ⋮ A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs ⋮ Unifying stabilization and termination in message-passing systems ⋮ The alternator ⋮ A self-stabilizing quorum-based protocol for maxima computing ⋮ A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET ⋮ An optimal self-stabilizing strarvation-free alternator

Cites Work

• Self-stabilization of dynamic systems assuming only read/write atomicity
• Memory requirements for silent stabilization
• Self-stabilizing systems in spite of distributed control
• Distributed reset
• Token systems that self-stabilize

This page was built for publication: A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments