loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'05)
Efficient Leader Election in Complete Networks
Lugano, Switzerland
February 09-February 12
ISBN: 0-7695-2280-7
ASCII Text
x 
 
J. Villadangos, A. C?rdoba, F. Fari?, M. Prieto, "Efficient Leader Election in Complete Networks," Parallel, Distributed, and Network-Based Processing, Euromicro Conference on, pp. 136-143, 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/EMPDP.2005.21,
author = {J. Villadangos and A. C?rdoba and F. Fari? and M. Prieto},
title = {Efficient Leader Election in Complete Networks},
journal ={Parallel, Distributed, and Network-Based Processing, Euromicro Conference on},
volume = {0},
year = {2005},
issn = {1066-6192},
pages = {136-143},
doi = {http://doi.ieeecomputersociety.org/10.1109/EMPDP.2005.21},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
TI - Efficient Leader Election in Complete Networks
SN - 1066-6192
SP136
EP143
A1 - J. Villadangos,
A1 - A. C?rdoba,
A1 - F. Fari?,
A1 - M. Prieto,
PY - 2005
KW - leader election
KW - complete networks
KW - distributed algorithms
KW - I/O automata
VL - 0
JA - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
ER -
 
J. Villadangos, Universidad P?blica de Navarra, Spain
A. C?rdoba, Universidad P?blica de Navarra, Spain
F. Fari?, Universidad P?blica de Navarra, Spain
M. Prieto, Universidad P?blica de Navarra, Spain
Leader election is a fundamental problem in distributed computing and it has been studied assuming various computation models and network topologies. This paper analyzes the algorithms for leader election in complete networks using asynchronous communication channels. We present a novel algorithm that reduces the information necessary to select a leader compared with other leader election algorithms for complete networks. In this paper, the algorithm works without sense of direction. And, it does not require to know the number of nodes in the system. Our proposal requires O(n) messages and O(n) time, where n is the number of nodes in the system, to elect a leader.
Index Terms:
leader election, complete networks, distributed algorithms, I/O automata
Citation:
J. Villadangos, A. C?rdoba, F. Fari?, M. Prieto, "Efficient Leader Election in Complete Networks," pdp, pp.136-143, 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.