INFORMAZIONI SU QUESTO ARTICOLO
Pubblicato online: 06 giu 2014
Pagine: 54 - 1
Ricevuto: 22 mar 2013
DOI: https://doi.org/10.2478/ausm-2014-0005
Parole chiave
© 2014
This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
Worst, best and average number of messages and running time of leader election algorithms of different distributed systems are analyzed. Among others the known characterizations of the expected number of messages for LCR algorithm and of the worst number of messages of Hirschberg-Sinclair algorithm are improved