Leader election in synchronous networks
Antal Iványi · Acta Universitatis Sapientiae Mathematica · 2013
Abstract 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