An efficient message passing election algorithm based on Mazurkiewicz's algorithm

zbMATH Open1128.68006MaRDI QIDQ5431920FDOQ5431920

Yves Métivier, J. Chalopin

Publication date: 2 January 2008

Recommendations

• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Election in partially anonymous networks with arbitrary knowledge in message passing systems
• Distributed election in a circle without a global sense of orientation
• scientific article; zbMATH DE number 1759418
• scientific article; zbMATH DE number 6313182

zbMATH Keywords

coveringdistributed algorithmlocal computationelectionnaminganonymous networkasynchronous message passing model

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (1)

• Drawing maps with advice

This page was built for publication: An efficient message passing election algorithm based on Mazurkiewicz's algorithm

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