A probabilistic analysis of a leader election algorithm
Copyright policy )A probabilistic analysis of a leader election algorithm
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].
FOS: Computer and information sciences, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Election Algorithm. Randomized Selection Algorithm. Distributed Systems. Asymptotic Oscillating Behavior. Probabilistic de-Poissonization., [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], election algorithm. randomized selection algorithm. distributed systems. asymptotic oscillating behavior. probabilistic de-poissonization., Computer Science - Data Structures and Algorithms, QA1-939, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], Data Structures and Algorithms (cs.DS), Mathematics, [math.math-co] mathematics [math]/combinatorics [math.co]
FOS: Computer and information sciences, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Election Algorithm. Randomized Selection Algorithm. Distributed Systems. Asymptotic Oscillating Behavior. Probabilistic de-Poissonization., [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], election algorithm. randomized selection algorithm. distributed systems. asymptotic oscillating behavior. probabilistic de-poissonization., Computer Science - Data Structures and Algorithms, QA1-939, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], Data Structures and Algorithms (cs.DS), Mathematics, [math.math-co] mathematics [math]/combinatorics [math.co]
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!