Bounded time-stamps
From MaRDI portal
Recommendations
Cites work
- A Constructive Solution to a Tournament Problem
- A new solution of Dijkstra's concurrent programming problem
- A new solution to the critical section problem
- Cooperative Distributed Algorithms for Dynamic Cycle Prevention
- Distributed network protocols
- On a Problem in Graph Theory
- On a Problem of Schütte and Erdös
- Simple and efficient bounded concurrent timestamping and the traceable use abstraction
- The mutual exclusion problem
- The mutual exclusion problem
- Time-Lapse Snapshots
Cited in
(19)- Bounded time-stamping in message-passing systems
- Efficient and robust sharing of memory in message-passing systems (extended abstract)
- Time stamps for fixed-point approximation
- Self-stabilizing timestamps
- Efficient algorithms for checking the atomicity of a run of read and write operations
- Atomic snapshots using lattice agreement
- Simple and efficient bounded concurrent timestamping and the traceable use abstraction
- Self-stabilizing \(\ell\)-exclusion
- Time and space optimal implementations of atomic multi-writer register
- Practically stabilizing SWMR atomic memory in message-passing systems
- Space lower bounds for the signal detection problem
- Towards a practical snapshot algorithm
- Nonatomic dual bakery algorithm with bounded tokens
- The space complexity of unbounded timestamps
- The F-Snapshot Problem
- Highly-fair bakery algorithm using symmetric tokens
- scientific article; zbMATH DE number 1825103 (Why is no real title available?)
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Randomized two-process wait-free test-and-set
This page was built for publication: Bounded time-stamps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261108)
