Stabilizing unison

DOI10.1016/0020-0190(90)90020-XzbMath0702.68026OpenAlexW2914863966MaRDI QIDQ915420

Mohamed G. Gouda, Ted Herman

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90020-x

zbMATH Keywords

self-stabilizationclock synchronizationunisondistributed synchronous systemsrealtime

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (21)

Four-state stabilizing phase clock for unidirectional rings of odd size ⋮ SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE ⋮ On self-stabilizing wait-free clock synchronization ⋮ Global Synchronization of Pulse-Coupled Oscillators on Trees ⋮ A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph ⋮ A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM ⋮ Unison, canon, and sluggish clocks in networks controlled by a synchronizer ⋮ Efficient Counting with Optimal Resilience ⋮ Parallel composition for time-to-fault adaptive stabilization ⋮ Self-stabilizing Byzantine asynchronous unison ⋮ Synchronous vs. asynchronous unison ⋮ A self-stabilizing algorithm for the maximum flow problem ⋮ SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS ⋮ Stabilizing phase-clocks ⋮ A self-stabilizing algorithm for maximal matching ⋮ Dynamic FTSS in asynchronous systems: the case of unison ⋮ On the Microscopic View of Time and Messages ⋮ A self-stabilizing algorithm for detecting fundamental cycles in a graph ⋮ A self-stabilizing distributed algorithm to find the median of a tree graph ⋮ A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH ⋮ A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph

Cites Work

• Token systems that self-stabilize

This page was built for publication: Stabilizing unison