Bounded time-stamps
From MaRDI portal
Publication:1261108
DOI10.1007/BF02242708zbMath0776.68018MaRDI QIDQ1261108
Publication date: 16 September 1993
Published in: Distributed Computing (Search for Journal in Brave)
Related Items (15)
Self-stabilizing timestamps ⋮ Efficient algorithms for checking the atomicity of a run of read and write operations ⋮ Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ The space complexity of unbounded timestamps ⋮ Highly-fair bakery algorithm using symmetric tokens ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ Atomic snapshots using lattice agreement ⋮ Randomized two-process wait-free test-and-set ⋮ Practically stabilizing SWMR atomic memory in message-passing systems ⋮ Time and space optimal implementations of atomic multi-writer register ⋮ Towards a practical snapshot algorithm ⋮ Self-stabilizing \(\ell\)-exclusion ⋮ Space lower bounds for the signal detection problem ⋮ Nonatomic dual bakery algorithm with bounded tokens ⋮ The F-Snapshot Problem
Cites Work
- Simple and efficient bounded concurrent timestamping and the traceable use abstraction
- Distributed network protocols
- Time-Lapse Snapshots
- Cooperative Distributed Algorithms for Dynamic Cycle Prevention
- A new solution of Dijkstra's concurrent programming problem
- On a Problem of Schütte and Erdös
- A new solution to the critical section problem
- A Constructive Solution to a Tournament Problem
- On a Problem in Graph Theory
- The mutual exclusion problem
- The mutual exclusion problem
This page was built for publication: Bounded time-stamps
