Skip to Main content Skip to Navigation

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

Cited literature [20 references]  Display  Hide  Download
Contributor : Julien Stainer Connect in order to contact the contributor
Submitted on : Thursday, December 5, 2013 - 2:23:51 PM
Last modification on : Monday, August 8, 2022 - 5:38:05 PM
Long-term archiving on: : Thursday, March 6, 2014 - 8:55:18 AM


Files produced by the author(s)


  • HAL Id : hal-00825619, version 3


Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer. Computing in the Presence of Concurrent Solo Executions. [Research Report] PI-2004, 2013. ⟨hal-00825619v3⟩



Record views


Files downloads