A probabilistic analysis of a leader election algorithm

Abstract : A leader election algorithm is an elimination process that divides recursively into tow subgroups an initial group of n items, eliminates one subgroup and continues the procedure until a subgroup is of size 1. In this paper the biased case is analyzed. We are interested in the cost of the algorithm e. the number of operations needed until the algorithm stops. Using a probabilistic approach, the asymptotic behavior of the algorithm is shown to be related to the behavior of a hitting time of two random sequences on [0,1].
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-00130117
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 17, 2015 - 2:26:07 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Wednesday, November 18, 2015 - 12:11:46 PM

File

dmAG0115.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00130117, version 2

Collections

Citation

Hanene Mohamed. A probabilistic analysis of a leader election algorithm. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.225-236. ⟨hal-00130117v2⟩

Share

Metrics

Record views

270

Files downloads

265