Space-optimal multi-writer snapshot objects are slow

DOI10.1145/571825.571828zbMath1292.68085OpenAlexW2128498475MaRDI QIDQ5170861

Panagiota Fatourou, Eric Ruppert, Faith E. Fich

Publication date: 25 July 2014

Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Solo-valency and the cost of coordination ⋮ Lower and upper bounds for single-scanner snapshot implementations ⋮ Hundreds of impossibility results for distributed computing ⋮ Linear space bootstrap communication schemes

This page was built for publication: Space-optimal multi-writer snapshot objects are slow