The F-Snapshot Problem

DOI10.1007/978-3-319-48314-6_11zbMath1482.68051arXiv1510.02211OpenAlexW2268234151MaRDI QIDQ2835024

Gal Amram

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.02211

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• The time complexity of updating snapshot memories
• The mailbox problem
• Bounded time-stamps
• Model-checking of correctness conditions for concurrent objects
• Composite registers
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• The Mailbox Problem
• Proving the Correctness of Multiprocess Programs
• Atomic snapshots of shared memory
• Bounded Concurrent Time-Stamping
• 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
• On the Signaling Problem

This page was built for publication: The F-Snapshot Problem