An optimal multi-writer snapshot algorithm

DOI10.1145/1060590.1060697MaRDI QIDQ3581459zbMATH OpenOpenAlexFDO

Authors Prasad Jayanti

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1060590.1060697

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(10)

• Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
• Lower and upper bounds for single-scanner snapshot implementations
• Of concurrent data structures and iterations
• Linear space bootstrap communication schemes
• Limited-use atomic snapshots with polylogarithmic step complexity
• The complexity of updating snapshot objects
• Help when needed, but no more: efficient read/write partial snapshot
• Executable contracts for Elixir
• Strongly linearizable LL/SC from CAS
• MemSnap: a fast adaptive snapshot algorithm for RMWable shared-memory

This page was built for publication: An optimal multi-writer snapshot algorithm

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