Asymptotically Optimal Election on Weighted Rings

DOI10.1137/S0097539795288799zbMATH Open0914.68095OpenAlexW1971073047MaRDI QIDQ4210174FDOQ4210174

Authors Lisa Higham, Teresa Przytycka 

Publication date 21 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539795288799

zbMATH Keywords

asynchronous networkmessage complexitydistributed electionweighted ring

Mathematics Subject Classification ID

Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• Asymptotically optimal election on weighted rings
• Optimal cost-sensitive distributed minimum spanning tree algorithm
• scientific article; zbMATH DE number 2113969
• Electing a leader in a ring with link failures
• scientific article; zbMATH DE number 749831

Cites work

• A simple, efficient algorithm for maximum finding on rings
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• Lower Bounds for Distributed Maximum-Finding Algorithms

Cited in

(3)

• Asymptotically optimal election on weighted rings
• Hundreds of impossibility results for distributed computing
• Optimal cost-sensitive distributed minimum spanning tree algorithm

This page was built for publication: Asymptotically Optimal Election on Weighted Rings

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