Back to Search
Start Over
ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM.
- Source :
- International Journal of Foundations of Computer Science; Dec2008, Vol. 19 Issue 6, p1387-1402, 16p, 4 Diagrams, 2 Charts
- Publication Year :
- 2008
-
Abstract
- This paper focuses on the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm is O(N<superscript>4</superscript>), where N is the number of nodes in the tree. We show that the average execution time for this algorithm, assuming two different scenarios, is much lower than O(N<superscript>4</superscript>). In the first scenario, the algorithm assumes an equiprobable daemon and it only privileges a single node at a time. The average execution time for this case is O(N<superscript>2</superscript>). For the second case, the algorithm can privilege multiple nodes at a time. We eliminate the daemon from this algorithm by making random choices to avoid interference between neighboring nodes. The execution time for this case is O(N). We also show that for specific tree graphs, these results reduce even more. [ABSTRACT FROM AUTHOR]
- Subjects :
- RESEARCH
ALGORITHMS
GRAPHIC methods
MACHINE theory
COMPUTER programming
Subjects
Details
- Language :
- English
- ISSN :
- 01290541
- Volume :
- 19
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 35976680