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

DOI10.1016/0304-3975(90)90162-BMaRDI QIDQ910221zbMATHOpenAlexFDO

Authors 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 software (68N99) Theory of operating systems (68N25)

Recommendations

• Average number of messages for distributed leader finding in rings of processors
• Average number of messages for distributed leader-fitting in rings of processors
• Distributed election in a circle without a global sense of orientation
• Towards optimal distributed election on chordal rings
• Communication and time complexity of a distributed election protocol

Cites work

• scientific article; zbMATH DE number 3850459 (Why is no real title available?)
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3978376 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3224156 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3349815 (Why is no real title available?)
• A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
• A unifying look at data structures
• 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

Cited in

(4)

• Average number of messages for distributed leader finding in rings of processors
• scientific article; zbMATH DE number 3978376 (Why is no real title available?)
• Communication and time complexity of a distributed election protocol
• Average number of messages for distributed leader-fitting in rings of processors

This page was built for publication: Exact average message complexity values for distributed election on bidirectional rings of processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910221)