A tight time lower bound for space-optimal implementations of multi-writer snapshots

DOI10.1145/780542.780582zbMath1192.68082OpenAlexW1998968025MaRDI QIDQ3581246

Eric Ruppert, Panagiota Fatourou, Faith E. Fich

Publication date: 16 August 2010

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

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

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

Lower and upper bounds for single-scanner snapshot implementations ⋮ Hundreds of impossibility results for distributed computing ⋮ The complexity of updating snapshot objects

This page was built for publication: A tight time lower bound for space-optimal implementations of multi-writer snapshots