MPI-I-95-1-016
Wait-free consensus in "in-phase" multiprocessor systems
Papatriantafilou, Marina and Tsigas, Philippas
July 1995, 12 pages.
.
Status: available - back from printing
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.
-
MPI-I-95-1-016.pdf
- Attachement: MPI-I-95-1-016.ps.gz (58 KBytes); MPI-I-95-1-016.pdf (208 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1995-1-016
BibTeX
@TECHREPORT{PapatriantafilouTsigas95,
AUTHOR = {Papatriantafilou, Marina and Tsigas, Philippas},
TITLE = {Wait-free consensus in "in-phase" multiprocessor systems},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-95-1-016},
MONTH = {July},
YEAR = {1995},
ISSN = {0946-011X},
}