Average number of messages for distributed leader-fitting in rings of processors

DOI10.1016/0020-0190(89)90208-1zbMath0667.68055OpenAlexW1977844762MaRDI QIDQ1117694

Christian Lavault

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90208-1

zbMATH Keywords

distributed algorithmasynchronous bidirectional ring of processorsaverage message complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Some lower bound results for decentralized extrema-finding in rings of processors ⋮ Exact average message complexity values for distributed election on bidirectional rings of processors ⋮ New lower bound techniques for distributed leader finding and other problems on rings of processors

Cites Work

• Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
• A unifying look at data structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Average number of messages for distributed leader-fitting in rings of processors