Exact average message complexity values for distributed election on bidirectional rings of processors

DOI10.1016/0304-3975(90)90162-BzbMath0695.68040OpenAlexW1964069744MaRDI QIDQ910221

Christian Lavault

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90162-b

zbMATH Keywords

distributed systemdistributed election algorithmleader finding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Theory of software (68N99)

Cites Work

• A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
• Average number of messages for distributed leader-fitting in rings of processors
• Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
• Théorie géométrique des polynômes eulériens
• A unifying look at data structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item