Analysis of an asymmetric leader election algorithm (Q1378508)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Analysis of an asymmetric leader election algorithm
scientific article

    Statements

    Analysis of an asymmetric leader election algorithm (English)
    0 references
    0 references
    0 references
    12 February 1998
    0 references
    Summary: 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 object 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.
    0 references
    leader election algorithm
    0 references
    election process
    0 references
    limiting distribution
    0 references

    Identifiers