de.mpg.escidoc.pubman.appbase.FacesBean
English

# Item

ITEM ACTIONSEXPORT

Released

Report

#### Wait-free consensus in "in-phase" multiprocessor systems

##### MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45161

Papatriantafilou,  Marina
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45640

Tsigas,  Philippas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

##### Locator
There are no locators available
##### Fulltext (public)

MPI-I-95-1-016.pdf
(Any fulltext), 208KB

##### Supplementary Material (public)
There is no public supplementary material available
##### Citation

Papatriantafilou, M., & Tsigas, P.(1995). Wait-free consensus in "in-phase" multiprocessor systems (MPI-I-1995-1-016). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-A44D-E
##### Abstract
In the {\em consensus} problem in a system with $n$ processes, each process starts with a private input value and runs until it chooses irrevocably a decision value, which was the input value of some process of the system; moreover, all processes have to decide on the same value. This work deals with the problem of {\em wait-free} ---fully resilient to processor crash and napping failures--- consensus of $n$ processes in an in-phase" multiprocessor system. It proves the existence of a solution to the problem in this system by presenting a protocol which ensures that a process will reach decision within at most $n(n-3)/2 +3$ steps of its own in the worst case, or within $n$ steps if no process fails.