Synchronous vs. asynchronous unison

DOI10.1007/s00453-007-9066-xzbMath1139.68013OpenAlexW2013801588MaRDI QIDQ926286

Vincent Villain, Christian Boulinier, Franck Petit

Publication date: 27 May 2008

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9066-x

zbMATH Keywords

Computational complexitySelf-stabilizationPhase synchronizationUnison

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (5)

A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem ⋮ Weak vs. Self vs. Probabilistic Stabilization ⋮ Efficient Counting with Optimal Resilience ⋮ Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples ⋮ Synchronization modulo \(P\) in dynamic networks

Cites Work

• Stabilizing phase-clocks
• Alternators in read/write atomicity
• Stabilizing unison
• Phase synchronization
• Self-stabilizing systems in spite of distributed control
• When graph theory helps self-stabilization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronous vs. asynchronous unison