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

synchronizationself-stabilizationasynchronous unisonlocal (group) mutual exclusion

Mathematics Subject Classification ID

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

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