by Svante Janson, Wojciech Szpankowski
Electronic J. Combin
http://www2.combinatorics.org/Volume_4/PostScriptfiles/v4i1r17.ps
Add To MetaCart
Abstract:
We consider a leader election algorithm in which a set of distributed objects (people, computers, etc.) try to identify one object as their leader. The election process is randomized, that is, at every stage of the algorithm those objects that survived so far flip a biased coin, and those who received, say a tail, survive for the next round. The process continues until only one objects remains. Our interest is in evaluating the limiting distribution and the first two moments of the number of rounds needed to select a leader. We establish precise asymptotics for the first two moments, and show that the asymptotic expression for the duration of the algorithm exhibits some periodic fluctuations and consequently no limiting distribution exists. These results are proved by analytical techniques of the precise analysis of algorithms such as: analytical poissonization and depoissonization, Mellin transform, and complex analysis. 1
Citations
|
649
|
Handbook of Mathematical Functions
– Abramowitz, Stegun, et al.
- 1965
|
|
292
|
The Art of Computer Programming, Vol. 3: Sorting and Searching
– Knuth
- 1973
|
|
173
|
Evolution of Random Search Trees
– Mahmoud
- 1992
|
|
135
|
Uniform Distribution of Sequences
– Kuipers, Niederreiter
- 1974
|
|
109
|
Mellin transforms and asymptotics: Harmonic sums
– Flajolet, Gourdon, et al.
- 1995
|
|
91
|
Brately P Algorithmics : Theory and Practice
– Brassard
- 1988
|
|
47
|
Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and
– Jacquet, Szpankowski
- 1995
|
|
33
|
Trie partitioning process: limiting distributions
– Jacquet, Régnier
- 1986
|
|
28
|
Limiting distribution for the depth in Patricia tries
– Rais, Jacquet, et al.
- 1993
|
|
18
|
On the distribution for the duration of a randomized leader election algorithm
– Fill, Mahmoud, et al.
- 1996
|
|
16
|
A study of trie-like structures under the density model
– Devroye
- 1992
|
|
16
|
Algebraic methods for trie statistics
– Flajolet, R'egnier, et al.
- 1985
|
|
15
|
On a functional equation arising in the analysis of a protocol for a multi-accessbroadcast channel
– Fayolle, Flajolet, et al.
- 1986
|
|
12
|
Normal limiting distribution of the size of tries
– Jacquet, Régnier
- 1988
|
|
11
|
How to select a loser
– Prodinger
- 1993
|
|
9
|
The analysis of linear probing sort by the use of a new mathematical transform
– Gonnet, Munro
- 1984
|
|
7
|
Trie partitioning process: limiting distributions
– Jacquet, Régnier
- 1986
|
|
7
|
Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm
– Jacquet, Szpankowski
- 1989
|
|
6
|
Searching for losers. Random Structures and Algorithms
– Grabner
- 1993
|
|
5
|
Solution to a Linear Recurrence Equation Arising in the Analysis of Some Algorithms
– Szpankowski
- 1987
|
|
2
|
Analytical Depoissonization and Its Applications, Theoretical Computer Science, to appear. the electronic journal of combinatorics 4
– Jacquet, Szpankowski
- 1997
|
|
2
|
The Average CRI-length of a Tree Collision Resolution Algorithm
– Schmid
- 1992
|
