From bounded to unbounded concurrency objects and back

DOI10.1145/1993806.1993823zbMATH Open1321.68269OpenAlexW2057582953MaRDI QIDQ2943391FDOQ2943391

Authors: Yehuda Afek, Adam Morrison, Guy Wertheim 

Publication date: 11 September 2015

Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

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

Recommendations

• Common2 extended to stacks and unbounded concurrency
• Common2 extended to stacks and unbounded concurrency
• The concurrency hierarchy, and algorithms for unbounded concurrency
• The power of multiobjects.
• Computing with infinitely many processes

zbMATH Keywords

consensuswait-freeswapunbounded concurrency

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Flooding time in edge-Markovian dynamic graphs
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Parsimonious flooding in dynamic graphs
• Distributed computation in dynamic networks
• Continuous consensus via common knowledge
• Reaching Agreement in the Presence of Faults
• Knowledge and common knowledge in a distributed environment
• Perfectly secure message transmission
• Programming simultaneous actions using common knowledge
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Consensus algorithms with one-bit messages
• Broadcasting in dynamic radio networks
• Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
• Fault Tolerance in Networks of Bounded Degree
• Optimal gradient clock synchronization in dynamic networks
• Almost-Everywhere Secure Computation
• Gradient clock synchronization in dynamic networks

Cited In (9)

• Unifying Concurrent Objects and Distributed Tasks
• Computing with infinitely many processes
• The concurrency hierarchy, and algorithms for unbounded concurrency
• Alternation and bounded concurrency are reverse equivalent.
• Extending the wait-free hierarchy to multi-threaded systems
• Common2 extended to stacks and unbounded concurrency
• Bounded disagreement
• Common2 extended to stacks and unbounded concurrency
• Short note: Strict unwraps make worker/wrapper fusion totally correct

This page was built for publication: From bounded to unbounded concurrency objects and back

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943391)