Time-Lapse Snapshots
From MaRDI portal
Publication:4268845
DOI10.1137/S0097539793243685zbMath0928.68135MaRDI QIDQ4268845
Cynthia Dwork, Orli Waarts, Maurice P. Herlihy, Serge A. Plotkin
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
distributed computingdistributed algorithmstimestampingshared-memory algorithmsatomic snapshotsasynchronous PRAMStime-lapse snapshots
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items
The time complexity of updating snapshot memories, Of Concurrent Data Structures and Iterations, The space complexity of unbounded timestamps, How a rainbow coloring function can simulate wait-free handshaking, Linear-time snapshot implementations in unbalanced systems, Efficient Bounded Timestamping from Standard Synchronization Primitives, Atomic snapshots using lattice agreement, Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study, Randomized protocols for asynchronous consensus, The complexity of updating snapshot objects, Towards a practical snapshot algorithm, Self-stabilizing \(\ell\)-exclusion, Bounded time-stamps, Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
