Time-space tradeoffs for implementations of snapshots

DOI10.1145/1132516.1132542zbMath1301.68187OpenAlexW2007397266MaRDI QIDQ2931381

Panagiota Fatourou, Eric Ruppert, Faith E. Fich

Publication date: 25 November 2014

Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

snapshotlower bounddistributed computingtime-space tradeoffshared memorywait-freeanonymous processes

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05) Distributed systems (68M14)

Related Items (7)

Of Concurrent Data Structures and Iterations ⋮ The space complexity of unbounded timestamps ⋮ Lower and upper bounds for single-scanner snapshot implementations ⋮ Progress-Space Tradeoffs in Single-Writer Memory Implementations ⋮ Anonymous and fault-tolerant shared-memory computing ⋮ Linear space bootstrap communication schemes ⋮ The complexity of updating snapshot objects

This page was built for publication: Time-space tradeoffs for implementations of snapshots