Common2 extended to stacks and unbounded concurrency

DOI10.1145/1146381.1146415zbMath1314.68131OpenAlexW2136094140MaRDI QIDQ5177283

Yehuda Afek, Eli Gafni, Adam Morrison

Publication date: 10 March 2015

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

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

zbMATH Keywords

queuestackwait-freeunbounded concurrencyimmediate snapshotCommon2consensus number 2

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

On the viability of the deterministic consensus hierarchy ⋮ A closer look at fault tolerance

This page was built for publication: Common2 extended to stacks and unbounded concurrency