The complexity of updating snapshot objects

DOI10.1016/J.JPDC.2011.08.002zbMath1231.68064OpenAlexW1975724434MaRDI QIDQ663413

Panagiota Fatourou, Hagit Attiya, Faith Ellen

Publication date: 14 February 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.08.002

zbMATH Keywords

snapshotslower boundsupdates

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Lower and upper bounds for single-scanner snapshot implementations ⋮ What Can be Computed in a Distributed System?

Cites Work

• Unnamed Item
• Unnamed Item
• The time complexity of updating snapshot memories
• Inherent limitations on disjoint-access parallel implementations of transactional memory
• Composite registers
• Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
• Time-space tradeoffs for implementations of snapshots
• On the space complexity of randomized synchronization
• Time lower bounds for implementations of multi-writer snapshots
• A tight time lower bound for space-optimal implementations of multi-writer snapshots
• An optimal multi-writer snapshot algorithm
• Time-Lapse Snapshots
• Atomic snapshots of shared memory
• Atomic Snapshots in O (n log n) Operations
• Time and Space Lower Bounds for Nonblocking Implementations
• Linear-time snapshot implementations in unbalanced systems
• f -arrays
• Single-scanner multi-writer snapshot implementations are fast!
• Randomized wait-free concurrent objects (extended abstract)
• Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS
• SOFSEM 2005: Theory and Practice of Computer Science
• Towards a practical snapshot algorithm

This page was built for publication: The complexity of updating snapshot objects