Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 171-182
- https://doi.org/10.1007/3-540-51687-5_41
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Making distributed spanning tree algorithms fault-resilientPublished by Springer Nature ,2006
- Election in a complete network with a sense of directionInformation Processing Letters, 1986
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Time and message bounds for election in synchronous and asynchronous complete networksPublished by Association for Computing Machinery (ACM) ,1985
- Sense of direction, topological awareness and communication complexityACM SIGACT News, 1984
- Tight lower and upper bounds for some distributed algorithms for a complete network of processorsPublished by Association for Computing Machinery (ACM) ,1984