An improved election algorithm in chordal ring networks

DOI10.1080/00207169108804012zbMath0742.68027OpenAlexW2164993117MaRDI QIDQ3991122

Yi Pan

Publication date: 28 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108804012

zbMATH Keywords

chordal ringelection algorithmmessage complexitylink complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items

A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings, On the impact of sense of direction on message complexity, Minimal sense of direction in regular networks, TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION

Cites Work

• Efficient elections in chordal ring networks
• Electing a leader in a synchronous ring
• Decentralized extrema-finding in circular configurations of processors
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• An improved algorithm for decentralized extrema-finding in circular configurations of processes