DOAJ Open Access 2006

A probabilistic analysis of a leader election algorithm

Hanene Mohamed

Lihat Sumber DOI

Abstrak

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].

Topik & Kata Kunci

Mathematics

Penulis (1)

Hanene Mohamed

Format Sitasi

APA MLA BibTeX

Mohamed, H. (2006). A probabilistic analysis of a leader election algorithm. https://doi.org/10.46298/dmtcs.3516

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3516

Informasi Jurnal

Tahun Terbit: 2006
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3516
Akses: Open Access ✓