An optimal multi-writer snapshot algorithm

DOI10.1145/1060590.1060697zbMath1192.68449OpenAlexW2155298875MaRDI QIDQ3581459

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)

Related Items (7)

Of Concurrent Data Structures and Iterations ⋮ Lower and upper bounds for single-scanner snapshot implementations ⋮ Linear space bootstrap communication schemes ⋮ The complexity of updating snapshot objects ⋮ Help when needed, but no more: efficient read/write partial snapshot ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects ⋮ Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity

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