Skip to Main content Skip to Navigation
Conference papers

Computing in the Presence of Concurrent Solo Executions

Abstract : In a wait-free model any number of processes may crash. A process runs solo when it computes its local output without receiving any information from other processes, either because they crashed or they are too slow. While in wait-free shared-memory models at most one process may run solo in an execution, any number of processes may have to run solo in an asynchronous wait-free message-passing model. This paper is on the computability power of models in which several processes may concurrently run solo. It first introduces a family of round-based wait-free models, called the d-solo models, 1 ≤ d ≤ n, where up to d processes may run solo. The paper gives then a characterization of the colorless tasks that can be solved in each d-solo model. It also introduces the (d,ε)-solo approximate agreement task, which generalizes ε-approximate agreement, and proves that (d,ε)-solo approximate agreement can be solved in the d-solo model, but cannot be solved in the (d + 1)-solo model. The paper studies also the relation linking d-set agreement and (d,ε)-solo approximate agreement in asynchronous wait-free message-passing systems. These results establish for the first time a hierarchy of wait-free models that, while weaker than the basic read/write model, are nevertheless strong enough to solve non-trivial tasks.
Complete list of metadata
Contributor : Julien Stainer Connect in order to contact the contributor
Submitted on : Friday, December 19, 2014 - 3:51:49 PM
Last modification on : Monday, August 8, 2022 - 5:38:05 PM

Links full text



Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer. Computing in the Presence of Concurrent Solo Executions. LATIN 2014: Theoretical Informatics, 2014, Montevideo, Uruguay. pp.214-225, ⟨10.1007/978-3-642-54423-1_19⟩. ⟨hal-01097416⟩



Record views