From bounded to unbounded concurrency objects and back

DOI10.1145/1993806.1993823MaRDI QIDQ2943391zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(9)

• Computing with infinitely many processes
• Short note: Strict unwraps make worker/wrapper fusion totally correct
• Unifying Concurrent Objects and Distributed Tasks
• 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
• Common2 extended to stacks and unbounded concurrency
• Bounded disagreement

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)