The Community for Technology Leaders
Green Image
<p>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.</p>
Index Termsdistributed algorithms; computational complexity; optical links; computer networks;switching theory; leader election algorithm; synchronous fiber-optic networks; timecomplexity; distributed algorithms; message complexity
V. Gummadi, H. Abu-Amara, "New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 891-896, August 1994, doi:10.1109/71.298218
93 ms
(Ver 3.3 (11022016))