When graph theory helps self-stabilization

DOI10.1145/1011767.1011790MaRDI QIDQ5501494zbMATH OpenOpenAlexFDO

Authors Christian Boulinier, Franck Petit, Vincent Villain

Publication date 3 August 2015

Published in Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

asynchronous unisonlocal (group) mutual exclusionself-stabilizationsynchronization

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On self-stabilizing wait-free clock synchronization
• Four-state stabilizing phase clock for unidirectional rings of odd size
• Randomization adaptive self-stabilization
• Self-stabilizing Space Optimal Synchronization Algorithms on Trees
• scientific article; zbMATH DE number 1304101

Cited in

(22)

• Stabilizing mobile philosophers
• A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• Self-stabilizing distributed algorithm for local mutual inclusion
• On probabilistic snap-stabilization
• Four-state stabilizing phase clock for unidirectional rings of odd size
• Global synchronization of pulse-coupled oscillators on trees
• Rooted cycle bases
• Self-stabilizing Cuts in Synchronous Networks
• scientific article; zbMATH DE number 2061542 (Why is no real title available?)
• Self-stabilizing Byzantine asynchronous unison
• Verifying recurrence properties in self-stabilization by checking the absence of finite counterexamples
• Snap-Stabilizing Waves in Anonymous Networks
• Dynamic FTSS in asynchronous systems: the case of unison
• Self-stabilizing metric graphs
• Neighborhood mutual remainder: self-stabilizing distributed implementation and applications
• Self-stabilizing synchronous unison in directed networks
• Reducing the number of messages in self-stabilizing protocols
• Silent anonymous snap-stabilizing termination detection
• Synchronous vs. asynchronous unison
• Distance-\(k\) knowledge in self-stabilizing algorithms
• A self-stabilizing algorithm for cut problems in synchronous networks

This page was built for publication: When graph theory helps self-stabilization

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