The space complexity of unbounded timestamps
From MaRDI portal
Publication:352241
DOI10.1007/s00446-008-0060-6zbMath1267.68119OpenAlexW2134091651MaRDI QIDQ352241
Eric Ruppert, Faith Ellen, Panagiota Fatourou
Publication date: 4 July 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.925.4095
Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (4)
The space complexity of long-lived and one-shot timestamp implementations ⋮ Efficient Bounded Timestamping from Standard Synchronization Primitives ⋮ Linear space bootstrap communication schemes ⋮ A Tight Space Bound for Consensus
Cites Work
- Computing on a partially eponymous ring
- Concerning the size of logical clocks in distributed systems
- Bounded time-stamps
- Bounds on shared memory for mutual exclusion
- Anonymous and fault-tolerant shared-memory computing
- Time-space tradeoffs for implementations of snapshots
- On the space complexity of randomized synchronization
- Simple and efficient bounded concurrent timestamping and the traceable use abstraction
- Bounded concurrent timestamp systems using vector clocks
- Algorithms adapting to point contention
- Fast randomized consensus using shared memory
- The Space Complexity of Unbounded Timestamps
- Time, clocks, and the ordering of events in a distributed system
- Time-Lapse Snapshots
- Bounded Concurrent Time-Stamping
- How to share concurrent wait-free variables
- Time and Space Lower Bounds for Nonblocking Implementations
- A new solution of Dijkstra's concurrent programming problem
- Randomized wait-free concurrent objects (extended abstract)
This page was built for publication: The space complexity of unbounded timestamps
