Help When Needed, But No More: Efficient Read/Write Partial Snapshot

DOI10.1007/978-3-642-04355-0_16zbMath1261.68028OpenAlexW1502418172MaRDI QIDQ3646222

Michel Raynal, Damien Imbs

Publication date: 19 November 2009

Published in: Lecture Notes in Computer Science (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)

Related Items (5)

The renaming problem in shared memory systems: an introduction ⋮ Help when needed, but no more: efficient read/write partial snapshot ⋮ Highly-efficient wait-free synchronization ⋮ Inherent limitations on disjoint-access parallel implementations of transactional memory ⋮ A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition

This page was built for publication: Help When Needed, But No More: Efficient Read/Write Partial Snapshot