The concurrency hierarchy, and algorithms for unbounded concurrency

DOI10.1145/383962.384008zbMath1333.68104OpenAlexW2015280401MaRDI QIDQ2787678

Eli Gafni, Michael Merritt, Gadi Taubenfeld

Publication date: 4 March 2016

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

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Related Items (12)

The \(k\)-simultaneous consensus problem ⋮ Extending the wait-free hierarchy to multi-threaded systems ⋮ Lower and upper bounds for single-scanner snapshot implementations ⋮ Store-collect in the presence of continuous churn with application to snapshots and lattice agreement ⋮ Computing with infinitely many processes ⋮ Are bundles good deals for first-order modal logic? ⋮ Active disk Paxos with infinitely many processes ⋮ Efficient adaptive collect algorithms ⋮ Common2 extended to stacks and unbounded concurrency ⋮ A closer look at fault tolerance ⋮ The computational structure of progress conditions and shared objects ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention

This page was built for publication: The concurrency hierarchy, and algorithms for unbounded concurrency