The complexity of updating multi-writer snapshot objects

DOI10.1145/1281100.1281151zbMath1283.68152OpenAlexW2032236979MaRDI QIDQ5401435

Panagiota Fatourou, Fiath Ellen, Hagit Attiya

Publication date: 13 March 2014

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

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

zbMATH Keywords

snapshotlower bounddistributed computingshared memoryupdate

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) Distributed systems (68M14)

Related Items (1)

Inherent limitations on disjoint-access parallel implementations of transactional memory

This page was built for publication: The complexity of updating multi-writer snapshot objects