Time-optimal leader election in general networks

David Peleg

doi:10.1016/0743-7315(90)90074-y

Time-optimal leader election in general networks

David Peleg

Stanford University

Research output: Contribution to journal › Article › peer-review

86 Scopus citations

Abstract

This note presents a simple time-optimal distributed algorithm for electing a leader in a general network. For several important classes of networks this algorithm is also message-optimal and thus performs better than previous algorithms for the problem.

Original language	English
Pages (from-to)	96-99
Number of pages	4
Journal	Journal of Parallel and Distributed Computing
Volume	8
Issue number	1
DOIs	https://doi.org/10.1016/0743-7315(90)90074-y
State	Published - Jan 1990
Externally published	Yes

Bibliographical note

Funding Information:
* Supported in part by a Weizmann fellowship and by the ONR under Contract N00014-85-C-0731. Current address: Department of Applied Mathematics, The Weizmann Institute, Rehovot 76100, Israel.

Funding

* Supported in part by a Weizmann fellowship and by the ONR under Contract N00014-85-C-0731. Current address: Department of Applied Mathematics, The Weizmann Institute, Rehovot 76100, Israel.

Funders	Funder number
Office of Naval Research	N00014-85-C-0731

Access to Document

10.1016/0743-7315(90)90074-y

Cite this

@article{9e81d52fa5384223a02d5b1e66bb13d3,

title = "Time-optimal leader election in general networks",

abstract = "This note presents a simple time-optimal distributed algorithm for electing a leader in a general network. For several important classes of networks this algorithm is also message-optimal and thus performs better than previous algorithms for the problem.",

author = "David Peleg",

note = "Funding Information: * Supported in part by a Weizmann fellowship and by the ONR under Contract N00014-85-C-0731. Current address: Department of Applied Mathematics, The Weizmann Institute, Rehovot 76100, Israel.",

year = "1990",

month = jan,

doi = "10.1016/0743-7315(90)90074-y",

language = "אנגלית",

volume = "8",

pages = "96--99",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Time-optimal leader election in general networks

AU - Peleg, David

N1 - Funding Information: * Supported in part by a Weizmann fellowship and by the ONR under Contract N00014-85-C-0731. Current address: Department of Applied Mathematics, The Weizmann Institute, Rehovot 76100, Israel.

PY - 1990/1

Y1 - 1990/1

N2 - This note presents a simple time-optimal distributed algorithm for electing a leader in a general network. For several important classes of networks this algorithm is also message-optimal and thus performs better than previous algorithms for the problem.

AB - This note presents a simple time-optimal distributed algorithm for electing a leader in a general network. For several important classes of networks this algorithm is also message-optimal and thus performs better than previous algorithms for the problem.

UR - https://www.scopus.com/pages/publications/0025209259

U2 - 10.1016/0743-7315(90)90074-y

DO - 10.1016/0743-7315(90)90074-y

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0025209259

SN - 0743-7315

VL - 8

SP - 96

EP - 99

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 1

ER -

Time-optimal leader election in general networks

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this