Towards optimal distributed election on chordal rings
- 14 June 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 38 (5), 265-270
- https://doi.org/10.1016/0020-0190(91)90069-t
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient elections in chordal ring networksAlgorithmica, 1989
- Election in a complete network with a sense of directionInformation Processing Letters, 1986
- Lower Bounds for Distributed Maximum-Finding AlgorithmsJournal of the ACM, 1984
- Sense of direction, topological awareness and communication complexityACM SIGACT News, 1984
- On the message complexity of distributed problemsInternational Journal of Parallel Programming, 1984
- Tight lower and upper bounds for some distributed algorithms for a complete network of processorsPublished by Association for Computing Machinery (ACM) ,1984
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema ProblemACM Transactions on Programming Languages and Systems, 1982
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circleJournal of Algorithms, 1982
- On an improved algorithm for decentralized extrema finding in circular configurations of processorsCommunications of the ACM, 1982
- Analysis of Chordal Ring NetworkIEEE Transactions on Computers, 1981