New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks

Authors:
H. Abu-Amara;V. Gummadi
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 4
Cited 0

Fault-Tolerant Distributed Algorithm for Election in Complete Networks

IEEE Transactions on Computers - Fault-Tolerant Computing
New models and algorithms for future networks

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
A locking protocol for resource coordination in distributed databases

ACM Transactions on Database Systems (TODS)
A principle for resilient sharing of distributed resources

ICSE '76 Proceedings of the 2nd international conference on Software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We improve on I. Cidon, I. Gopal and S. Kutten's leader election algorithm (Proc. 7th ACM Symp. Principles Distrib. Computing, Toronto, Ont., Canada. Aug. 1988) by presenting an algorithm that uses only O(/spl radic/n log D + f) time units to run on synchronous networks of degree f and diameter D, where f/spl ges/3. When f is 2, the algorithm uses only O(log D) time units.