Atomic snapshots using lattice agreement

DOI10.1007/BF02242714zbMath1448.68066DBLPjournals/dc/AttiyaHR95WikidataQ64216177 ScholiaQ64216177MaRDI QIDQ5136986

Hagit Attiya, Ophir Rachman, Maurice P. Herlihy

Publication date: 30 November 2020

Published in: Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

atomic snapshotlattice agreement

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (9)

The time complexity of updating snapshot memories ⋮ Store-collect in the presence of continuous churn with application to snapshots and lattice agreement ⋮ Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity ⋮ An adaptive collect algorithm with applications ⋮ Condition-based consensus solvability: a hierarchy of conditions and efficient protocols ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects ⋮ Unnamed Item ⋮ Towards a practical snapshot algorithm ⋮ Asynchronous reconfiguration with Byzantine failures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Bounded time-stamps
• Composite registers
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• Fast randomized consensus using shared memory
• On the minimal synchronism needed for distributed consensus
• Time-Lapse Snapshots
• Atomic snapshots of shared memory
• Time- and Space-Efficient Randomized Consensus
• Randomized wait-free concurrent objects (extended abstract)
• Resiliency of interactive distributed tasks (extended abstracts)
• Atomic snapshots in O(n log n) operations
• Bounded round number

This page was built for publication: Atomic snapshots using lattice agreement