On self-stabilizing wait-free clock synchronization
From MaRDI portal
Publication:5054767
DOI10.1007/3-540-58218-5_25zbMath1502.68044OpenAlexW1490861536MaRDI QIDQ5054767
Philippas Tsigas, Marina Papatriantafilou
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58218-5_25
synchronizationfault tolerancedistributed computingconcurrencywait-free synchronizationself-stabilizationsynchronous systemsdigital clocksPRAM computation model
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (2)
Self-stabilization of wait-free shared memory objects ⋮ Dynamic FTSS in asynchronous systems: the case of unison
Cites Work
- Unnamed Item
- Unnamed Item
- Stabilizing unison
- On the possibility and impossibility of achieving clock synchronization
- On interprocess communication. II: Algorithms
- A new fault-tolerant algorithm for clock synchronization
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Synchronizing clocks in the presence of faults
- Self-stabilizing systems in spite of distributed control
- Are wait-free algorithms fast?
- Dynamic fault-tolerant clock synchronization
- Wait-free clock synchronization
This page was built for publication: On self-stabilizing wait-free clock synchronization