An improved election algorithm in chordal ring networks
From MaRDI portal
Publication:3991122
DOI10.1080/00207169108804012zbMATH Open0742.68027OpenAlexW2164993117MaRDI QIDQ3991122FDOQ3991122
Authors: 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
Recommendations
- Efficient elections in chordal ring networks
- Towards optimal distributed election on chordal rings
- A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
- scientific article; zbMATH DE number 749831
- Distributed election in a circle without a global sense of orientation
Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)
Cites Work
- 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
- Efficient elections in chordal ring networks
- An improved algorithm for decentralized extrema-finding in circular configurations of processes
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
Cited In (9)
- Title not available (Why is that?)
- Optimal irreversible dynamos in chordal rings
- Sense of direction in processor networks
- On the impact of sense of direction on message complexity
- Minimal sense of direction in regular networks
- Efficient elections in chordal ring networks
- TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
- Efficient leader election using sense of direction
- A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
This page was built for publication: An improved election algorithm in chordal ring networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3991122)
