How Fast Can Eventual Synchrony Lead to Consensus?

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Partha Dutta Articles by Rachid Guerraoui Articles by Leslie Lamport

2005 International Conference on Dependable Systems and Networks (DSN'05)

How Fast Can Eventual Synchrony Lead to Consensus?

Yokohama, Japan

June 28-July 01

ISBN: 0-7695-2282-3

	ASCII Text	x
	Partha Dutta, Rachid Guerraoui, Leslie Lamport, "How Fast Can Eventual Synchrony Lead to Consensus?," Dependable Systems and Networks, International Conference on, pp. 22-27, 2005 International Conference on Dependable Systems and Networks (DSN'05), 2005.

	BibTex	x
	@article{ 10.1109/DSN.2005.54, author = {Partha Dutta and Rachid Guerraoui and Leslie Lamport}, title = {How Fast Can Eventual Synchrony Lead to Consensus?}, journal ={Dependable Systems and Networks, International Conference on}, volume = {0}, year = {2005}, isbn = {0-7695-2282-3}, pages = {22-27}, doi = {http://doi.ieeecomputersociety.org/10.1109/DSN.2005.54}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Dependable Systems and Networks, International Conference on TI - How Fast Can Eventual Synchrony Lead to Consensus? SN - 0-7695-2282-3 SP22 EP27 A1 - Partha Dutta, A1 - Rachid Guerraoui, A1 - Leslie Lamport, PY - 2005 KW - null VL - 0 JA - Dependable Systems and Networks, International Conference on ER -

Partha Dutta, EPFL

Rachid Guerraoui, EPFL

Leslie Lamport, Microsoft

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DSN.2005.54

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(δ).

Citation:

Partha Dutta, Rachid Guerraoui, Leslie Lamport, "How Fast Can Eventual Synchrony Lead to Consensus?," dsn, pp.22-27, 2005 International Conference on Dependable Systems and Networks (DSN'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.