From wait-free to arbitrary concurrent solo executions in colorless distributed computing

DOI10.1016/J.TCS.2017.04.007zbMATH Open1370.68029OpenAlexW2609404927MaRDI QIDQ2397607FDOQ2397607

Authors: Sergio Rajsbaum, Michel Raynal, Julien Stainer, Maurice Herlihy 

Publication date: 22 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.04.007

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

zbMATH Keywords

topologyasynchronous systemwait-free computingapproximate agreementcolorless taskread-write shared memory

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• Renaming in an asynchronous environment
• Title not available (Why is that?)
• Impossibility of distributed consensus with one faulty process
• Atomic snapshots of shared memory
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Generalized Universality
• The topological structure of asynchronous computability
• Concurrent programming: algorithms, principles, and foundations.
• Distributed universality
• The complexity of obstruction-free implementations
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Generalized FLP impossibility result for t-resilient asynchronous computations
• A combinatorial characterization of the distributed 1-solvable tasks
• Three-Processor Tasks Are Undecidable
• Title not available (Why is that?)
• The topology of shared-memory adversaries
• A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
• Immediate atomic snapshots and fast renaming
• The disagreement power of an adversary
• Principles of distributed systems. 14th international conference, OPODIS 2010, Tozeur, Tunisia, December 14--17, 2010. Proceedings
• A classification of wait-free loop agreement tasks
• Reaching approximate agreement in the presence of faults
• Power and limits of distributed computing shared memory models
• Sharing memory robustly in message-passing systems
• The BG distributed simulation algorithm
• The multiplicative power of consensus numbers
• Decomposition of distributed programs into communication-closed layers
• Chromatic subdivision of a simplicial complex
• Distributed computing through combinatorial topology
• New combinatorial topology bounds for renaming: the lower bound
• Title not available (Why is that?)
• Multidimensional agreement in Byzantine systems
• Distributed computability in Byzantine asynchronous systems
• Wait-free gathering without chirality
• Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
• Generalized symmetry breaking tasks and nondeterminism in concurrent objects
• Computing in the presence of concurrent solo executions

Cited In (7)

• Making local algorithms wait-free: the case of ring coloring
• Wait-free solvability of colorless tasks in anonymous shared-memory model
• Computing in the presence of concurrent solo executions
• Algebraic topology and distributed computing
• Brief Announcement: The MBroadcast Abstraction
• A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus
• Wait-free solvability of colorless tasks in anonymous shared-memory model

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)