Time lower bounds for implementations of multi-writer snapshots
From MaRDI portal
Publication:3546353
DOI10.1145/1314690.1314694zbMath1312.68022OpenAlexW2146013153MaRDI QIDQ3546353
Panagiota Fatourou, Eric Ruppert, Faith Ellen
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1314690.1314694
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (2)
Lower and upper bounds for single-scanner snapshot implementations ⋮ The complexity of updating snapshot objects
This page was built for publication: Time lower bounds for implementations of multi-writer snapshots