2005 International Conference on Dependable Systems and Networks (DSN'05) (2005)
June 28, 2005 to July 1, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DSN.2005.54
Partha Dutta , EPFL
Rachid Guerraoui , EPFL
Leslie Lamport , Microsoft
It is well known that the consensus problem can be solved in a distributed system if, after some time T_S, no process fails and there is some upper bound δ on how long it takes to deliver a message. We know of no existing algorithm that guarantees consensus among N processes before time T_S + O(Nδ). We show that consensus can be achieved by time T_S + O(δ).
P. Dutta, L. Lamport and R. Guerraoui, "How Fast Can Eventual Synchrony Lead to Consensus?," 2005 International Conference on Dependable Systems and Networks (DSN'05)(DSN), Yokohama, Japan, 2005, pp. 22-27.