A timely protocol to solve the distributed consensus problem that tolerates process crashes and message omissions is described. The protocol is optimal in terms of the number of communication steps needed to achieve consensus. The model on which the protocol is based relies on a priority-based communication network, a kind of network commonly used in practice to support real-time systems.

BibTex Entry

@inproceedings{Lima2001a,
 address = {London},
 author = {G. M. A. Lima and A. Burns},
 booktitle = {Proc. of the Work-in-Progress Session of the 22nd {IEEE} {R}eal-{T}ime {S}ymposium.},
 category = {scheduling},
 month = {Dec},
 note = {Available in the Tech. Report {YCS337} of the University of York, England},
 pages = {41-44},
 title = {A {T}imely {D}istributed {C}onsensus {S}olution in a {C}rash/{O}mission-{F}ault {E}nvironment},
 year = {2001}
}