Asymptotic Analysis of a Leader Election Algorithm - Université Sorbonne Paris Nord Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2006

Asymptotic Analysis of a Leader Election Algorithm

Résumé

Itai and Rodeh showed that, on the average, the communication of a leader election algorithm takes no more than $LN$ bits, where $L \simeq 2.441716$ and $N$ denotes the size of the ring. We give a precise asymptotic analysis of the average number of rounds $M(n)$ required by the algorithm, proving for example that $\dis M(\infty) := \lim_{n\to \infty} M(n) = 2.441715879\ldots$, where $n$ is the number of starting candidates in the election. Accurate asymptotic expressions of the second moment $M^{(2)}(n)$ of the discrete random variable at hand, its probability distribution, and the generalization to all moments are given. Corresponding asymptotic expansions $(n\to \infty)$ are provided for sufficiently large $j$, where $j$ counts the number of rounds. Our numerical results show that all computations perfectly fit the observed values. Finally, we investigate the generalization to probability $t/n$, where $t$ is a non negative real parameter. The real function $\dis M(\infty,t) := \lim_{n\to \infty} M(n,t)$ is shown to admit \textit{one unique minimum} $M(\infty,t^{*})$ on the real segment $(0,2)$. Furthermore, the variations of $M(\infty,t)$ on thewhole real line are also studied in detail.
Fichier principal
Vignette du fichier
AnaLEItaiRod06.pdf (237.52 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00084608 , version 1 (08-07-2006)

Identifiants

Citer

Christian Lavault, Guy Louchard. Asymptotic Analysis of a Leader Election Algorithm. Theoretical Computer Science, 2006, 359 (1-3), pp.239-254. ⟨hal-00084608⟩
99 Consultations
112 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More