Help when needed, but no more: efficient read/write partial snapshot

DOI10.1016/J.JPDC.2011.08.005zbMath1231.68082OpenAlexW2031083418MaRDI QIDQ663424

Damien Imbs, Michel Raynal

Publication date: 14 February 2012

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

Full work available at URL: https://hal.inria.fr/inria-00339292/file/PI-1907.pdf

zbMATH Keywords

efficiencyadaptive algorithmlocalitylinearizabilityconcurrencyasynchronyatomicityprocess crashasynchronous shared memory systemLL/SC atomic registerspartial snapshotread/write atomic registerwait-free algorithm

Mathematics Subject Classification ID

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

Related Items (6)

Unnamed Item ⋮ Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement ⋮ Power and limits of distributed computing shared memory models ⋮ Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity ⋮ Linear space bootstrap communication schemes ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms adapting to point contention
• An optimal multi-writer snapshot algorithm
• Help When Needed, But No More: Efficient Read/Write Partial Snapshot
• Atomic snapshots of shared memory
• Atomic Snapshots in O (n log n) Operations
• Randomized wait-free concurrent objects (extended abstract)
• Disjoint-access-parallel implementations of strong shared memory primitives
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: Help when needed, but no more: efficient read/write partial snapshot