Fault-tolerant distributed algorithm for election in complete networks
- 1 April 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 37 (4), 449-453
- https://doi.org/10.1109/12.2189
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Making distributed spanning tree algorithms fault-resilientPublished by Springer Nature ,2006
- A resilient distributed protocol for network synchronizationPublished by Association for Computing Machinery (ACM) ,1986
- Election in a complete network with a sense of directionInformation Processing Letters, 1986
- The effects of link failures on computations in asynchronous ringsPublished by Association for Computing Machinery (ACM) ,1986
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Improvements in the time complexity of two message-optimal election algorithmsPublished by Association for Computing Machinery (ACM) ,1985
- Time and message bounds for election in synchronous and asynchronous complete networksPublished by Association for Computing Machinery (ACM) ,1985
- Fail-stop processorsACM Transactions on Computer Systems, 1983
- A locking protocol for resource coordination in distributed databasesACM Transactions on Database Systems, 1980