From wait-free to arbitrary concurrent solo executions in colorless distributed computing
From MaRDI portal
Publication:2397607
Recommendations
- Computing in the presence of concurrent solo executions
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- A characterization of \(t\)-resilient colorless task anonymous solvability
- Simulations and reductions for colorless tasks
Cites work
- A classification of wait-free loop agreement tasks
- A combinatorial characterization of the distributed 1-solvable tasks
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
- Atomic snapshots of shared memory
- Chromatic subdivision of a simplicial complex
- Computing in the presence of concurrent solo executions
- Concurrent programming: algorithms, principles, and foundations.
- Decomposition of distributed programs into communication-closed layers
- Distributed computability in Byzantine asynchronous systems
- Distributed computing through combinatorial topology
- Distributed universality
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- Generalized Universality
- scientific article; zbMATH DE number 3174984 (Why is no real title available?)
- scientific article; zbMATH DE number 1559574 (Why is no real title available?)
- scientific article; zbMATH DE number 3326356 (Why is no real title available?)
- scientific article; zbMATH DE number 3195022 (Why is no real title available?)
- Immediate atomic snapshots and fast renaming
- Impossibility of distributed consensus with one faulty process
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Multidimensional agreement in Byzantine systems
- New combinatorial topology bounds for renaming: the lower bound
- Power and limits of distributed computing shared memory models
- Principles of distributed systems. 14th international conference, OPODIS 2010, Tozeur, Tunisia, December 14--17, 2010. Proceedings
- Reaching approximate agreement in the presence of faults
- Renaming in an asynchronous environment
- Sharing memory robustly in message-passing systems
- Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
- The BG distributed simulation algorithm
- The complexity of obstruction-free implementations
- The disagreement power of an adversary
- The multiplicative power of consensus numbers
- The topological structure of asynchronous computability
- The topology of shared-memory adversaries
- Three-Processor Tasks Are Undecidable
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Wait-free gathering without chirality
Cited in
(8)- Computing in the presence of concurrent solo executions
- Making local algorithms wait-free: the case of ring coloring
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Brief Announcement: The MBroadcast Abstraction
- A topological view of partitioning arguments: reducing k-set agreement to consensus
- Algebraic topology and distributed computing
- A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
This page was built for publication: From wait-free to arbitrary concurrent solo executions in colorless distributed computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397607)
