2004 | OriginalPaper | Chapter
Leader Election in Hyper-Butterfly Graphs
Authors : Wei Shi, Pradip K. Srimani
Published in: Network and Parallel Computing
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Leader election in a network is one of the most important problems in the area of distributed algorithm design. Consider any network of N nodes; a leader node is defined to be any node of the network unambiguously identified by some characteristics (unique from all other nodes). A leader election process is defined to be a uniform algorithm (code) executed at each node of the network; at the end of the algorithm execution, exactly one node is elected the leader and all other nodes are in the non-leader state [GHS83, LMW86, Tel93, Tel95a, SBTS01]. In this paper, our purpose is to propose an election algorithm for the oriented hyper butterfly networks with ${\mathcal O}({N}{\log N})$ messages.