This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient decentralized consensus protocols
May 1986 (vol. 12 no. 5)
pp. 600-607
T. V. Lakshman, Systems Design and Analysis Group, Department of Computer Science, University of Maryland, College Park, MD 20742
Ashok K. Agrawala, Systems Design and Analysis Group, Department of Computer Science, University of Maryland, College Park, MD 20742
Decentralized consensus protocols are characterized by successive rounds of message interchanges. Protocols which achieve a consensus in one round of message interchange require O(N2) messages, where N is the number of participants. In this paper, we present a communication scheme, based on finite projective planes, which requires only O(N√N) messages for each round. Using this communication scheme, we develop decentralized consensus protocols which achieve a consensus within two rounds of message interchange. The protocols are symmetric, and the communication scheme does not impose any hierarchical structure. We illustrate our scheme using blocking and nonblocking commit protocols, decentralized extrema finding, and computation of the sum function.
Index Terms:
Protocols,Clocks,Checkpointing,Concurrent computing,Distributed databases,Computer science,transaction management,Commit protocols,crash recovery,distributed database systems,distributed systems,fault tolerance,message complexity
Citation:
T. V. Lakshman, Ashok K. Agrawala, "Efficient decentralized consensus protocols," IEEE Transactions on Software Engineering, vol. 12, no. 5, pp. 600-607, May 1986, doi:10.1109/TSE.1986.6312956
Usage of this product signifies your acceptance of the Terms of Use.