Unifying self-stabilization and fault-tolerance

DOI10.1145/164051.164074MaRDI QIDQ5361379zbMATH OpenOpenAlexFDO

Authors Ajei S. Gopal, Kenneth J. Perry

Publication date 29 September 2017

Published in Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/164051.164074

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cited in

(8)

• A self-stabilizing distributed algorithm to find the median of a tree graph
• Fault-containing self-stabilizing distributed protocols
• A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
• A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
• Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors
• Dynamic FTSS in asynchronous systems: the case of unison
• Self-stabilization of wait-free shared memory objects
• Stabilizing leader election in partial synchronous systems with crash failures

This page was built for publication: Unifying self-stabilization and fault-tolerance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361379)