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

DOI10.1016/J.JPDC.2011.08.005MaRDI QIDQ663424zbMATH OpenOpenAlexFDO

Authors 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

adaptive algorithmasynchronous shared memory systemasynchronyatomicityconcurrencyefficiencylinearizabilityLL/SC atomic registerslocalitypartial snapshotprocess crashread/write atomic registerwait-free algorithm

Mathematics Subject Classification ID

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

Recommendations

• Help When Needed, But No More: Efficient Read/Write Partial Snapshot
• Atomic Snapshots in O (n log n) Operations
• Atomic snapshots using lattice agreement
• Efficient synchronous snapshots
• Atomic snapshots of shared memory

Cites work

• Algorithms adapting to point contention
• An optimal multi-writer snapshot algorithm
• Atomic Snapshots in O (n log n) Operations
• Atomic snapshots of shared memory
• Disjoint-access-parallel implementations of strong shared memory primitives
• Help When Needed, But No More: Efficient Read/Write Partial Snapshot
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• Randomized wait-free concurrent objects (extended abstract)
• SOFSEM 2005: Theory and Practice of Computer Science

Cited in

(8)

• Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
• Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
• scientific article; zbMATH DE number 7228882 (Why is no real title available?)
• Help When Needed, But No More: Efficient Read/Write Partial Snapshot
• Power and limits of distributed computing shared memory models
• Linear space bootstrap communication schemes
• Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
• Relaxed queues and stacks from read/write operations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q663424)