The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A resilient distributed protocol for network synchronization
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
Fault tolerant distributed majority commitment
Journal of Algorithms
End-to-end communication in unreliable networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Automatically increasing the fault-tolerance of distributed systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Computer networks
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
A locking protocol for resource coordination in distributed databases
ACM Transactions on Database Systems (TODS)
Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Proceedings of the 3rd International Workshop on Distributed Algorithms
Making Distributed Spanning Tree Algorithms Fault-Resilient
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A principle for resilient sharing of distributed resources
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Optimal Elections in Faulty Loop Networks and Applications
IEEE Transactions on Computers
A Highly Available Local Leader Election Service
IEEE Transactions on Software Engineering
Running EveryWare on the computational grid
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Clustering algorithms for wireless ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Writing Programs that Run EveryWare on the Computational Grid
IEEE Transactions on Parallel and Distributed Systems
Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
The Weakest Failure Detector for Solving Election Problems in Asynchronous Distributed Systems
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
An autonomic election algorithm based on emergence in natural systems
Integrated Computer-Aided Engineering - Autonomous Computing
The election problem in asynchronous distributed systems with bounded faulty processes
The Journal of Supercomputing
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
An efficient election protocol in a mobile computing environment
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Revisiting the election problem in asynchronous distributed systems
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Solving election problem in asynchronous distributed systems
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
The election problem in asynchronous distributed systems with bounded faulty processes
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
| Hi-index | 14.98 |
Considers the problem of fault-tolerant leader election in asynchronous complete (fully-connected) distributed networks. The processors are reliable, but some of the communication channels may fail intermittently before or during the execution of the algorithm. Channel failures are undetectable due to the asynchronous nature of the network. Let n be the number of processors in the network and f be the maximum number of faulty channels incident on each processor, where f/spl les/ 1/2 [n-1]. Our algorithm uses at most O(n/sup 2/+nf/sup 2/) messages to elect a unique leader of the network. Each message consists of at most O(log|T|) bits, where |T| is the cardinality of the set of processor identifiers. All previous algorithms either tolerated only benign failures such as fail-stop failures, assumed that the network is synchronous, tolerated only a small number of failures, or assumed that the faults are detectable. Our algorithm is the first election algorithm that is designed specifically for asynchronous intermittently faulty complete networks in which up to 1/4 n[n-1] channels may be faulty, where each processor is adjacent to no more than 1/2 [n-1] faulty channels, and where the faults are undetectable.