Lower bounds for adaptive collect and related objects

DOI10.1145/1011767.1011777zbMath1321.68278OpenAlexW1985671439MaRDI QIDQ5501483

Hagit Attiya, Yaniv Kaplan, Faith E. Fich

Publication date: 3 August 2015

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.3502

zbMATH Keywords

adaptivitycontentioncollectexclusive-write registerssensitive objectssolo terminationweak test\&set

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Efficient adaptive collect algorithms ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention

This page was built for publication: Lower bounds for adaptive collect and related objects