DocumentCode :
2881663
Title :
Choosing a leader on a hypercube
Author :
Robbins, Steven ; Robbins, Kay A.
Author_Institution :
Div. of Math., Comput. Sci. & Stat., Univ. of Texas, San Antonio, TX, USA
fYear :
1990
fDate :
7-9 Mar 1990
Firstpage :
469
Lastpage :
471
Abstract :
The problem of electing a leader via message passing on a network is a fundamental problem in distributed processing. The authors present a simple algorithm for election of a leader on a hypercube with n nodes in O(n) messages
Keywords :
multiprocessor interconnection networks; algorithm; distributed processing; election; hypercube; leader; message passing; Computer science; Distributed processing; Hypercubes; Mathematics; Message passing; Network topology; Nominations and elections; Resource management; Routing; Statistical distributions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on
Conference_Location :
Miami Beach, FL
Print_ISBN :
0-8186-2035-8
Type :
conf
DOI :
10.1109/PARBSE.1990.77181
Filename :
77181
Link To Document :
بازگشت