TY - GEN

T1 - A modular technique for the design of efficient distributed leader finding algorithms

AU - Korach, E.

AU - Kutten, S.

AU - Moran, S.

N1 - Publisher Copyright:
© 1985 ACM.

PY - 1985/8/1

Y1 - 1985/8/1

N2 - A general, modular technique for designing efficient leader finding algorithms in distributed, asynchronous networks is developed. This technique reduces the relatively complex problem of efficient leader finding to a simpler problem of efficient serial traversing of the corresponding network. The message complexity of the resulted leader finding algorithms is bounded by (f(n)+n)logn [ or (f (m )+n )logn ], where n is the number of nodes in the network [m is the number of edges in the network], and f (n) [f (m)] is the message complexity of traversing the nodes [edges] of the network. This result achieves in a unified way the best known upper bounds on the message complexity of leader finding algorithms for circular, complete and Eulerian networks, and generalizes to other classes of more complex networks. Also, some known results are thus improved by a constant factor.

AB - A general, modular technique for designing efficient leader finding algorithms in distributed, asynchronous networks is developed. This technique reduces the relatively complex problem of efficient leader finding to a simpler problem of efficient serial traversing of the corresponding network. The message complexity of the resulted leader finding algorithms is bounded by (f(n)+n)logn [ or (f (m )+n )logn ], where n is the number of nodes in the network [m is the number of edges in the network], and f (n) [f (m)] is the message complexity of traversing the nodes [edges] of the network. This result achieves in a unified way the best known upper bounds on the message complexity of leader finding algorithms for circular, complete and Eulerian networks, and generalizes to other classes of more complex networks. Also, some known results are thus improved by a constant factor.

UR - http://www.scopus.com/inward/record.url?scp=85034635702&partnerID=8YFLogxK

U2 - 10.1145/323596.323611

DO - 10.1145/323596.323611

M3 - Conference contribution

AN - SCOPUS:85034635702

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 163

EP - 174

BT - Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985

A2 - Strong, Ray

A2 - Malcolm, Michael

PB - Association for Computing Machinery

T2 - 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985

Y2 - 5 August 1985 through 7 August 1985

ER -