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

E. Korach; S. Kutten; S. Moran

doi:10.1145/323596.323611

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

E. Korach, S. Kutten, S. Moran

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985
Editors	Ray Strong, Michael Malcolm
Publisher	Association for Computing Machinery
Pages	163-174
Number of pages	12
ISBN (Electronic)	0897911687
DOIs	https://doi.org/10.1145/323596.323611
State	Published - 1 Aug 1985
Externally published	Yes
Event	4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985 - Minaki, Canada Duration: 5 Aug 1985 → 7 Aug 1985

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985
Country/Territory	Canada
City	Minaki
Period	5/08/85 → 7/08/85

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/323596.323611

Cite this

Korach, E., Kutten, S., & Moran, S. (1985). A modular technique for the design of efficient distributed leader finding algorithms. In R. Strong, & M. Malcolm (Eds.), Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985 (pp. 163-174). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). Association for Computing Machinery. https://doi.org/10.1145/323596.323611

Korach, E. ; Kutten, S. ; Moran, S. / A modular technique for the design of efficient distributed leader finding algorithms. Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985. editor / Ray Strong ; Michael Malcolm. Association for Computing Machinery, 1985. pp. 163-174 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

@inproceedings{525b012dae9541a795fe79a3c8359015,

title = "A modular technique for the design of efficient distributed leader finding algorithms",

abstract = "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.",

author = "E. Korach and S. Kutten and S. Moran",

note = "Publisher Copyright: {\textcopyright} 1985 ACM.; 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985 ; Conference date: 05-08-1985 Through 07-08-1985",

year = "1985",

month = aug,

day = "1",

doi = "10.1145/323596.323611",

language = "English",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "163--174",

editor = "Ray Strong and Michael Malcolm",

booktitle = "Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985",

}

Korach, E, Kutten, S & Moran, S 1985, A modular technique for the design of efficient distributed leader finding algorithms. in R Strong & M Malcolm (eds), Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, pp. 163-174, 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985, Minaki, Canada, 5/08/85. https://doi.org/10.1145/323596.323611

A modular technique for the design of efficient distributed leader finding algorithms. / Korach, E.; Kutten, S.; Moran, S.
Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985. ed. / Ray Strong; Michael Malcolm. Association for Computing Machinery, 1985. p. 163-174 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Korach, E.

AU - Kutten, S.

AU - Moran, S.

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 -

Korach E, Kutten S, Moran S. A modular technique for the design of efficient distributed leader finding algorithms. In Strong R, Malcolm M, editors, Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985. Association for Computing Machinery. 1985. p. 163-174. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). doi: 10.1145/323596.323611

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this