Lower Bounds for Distributed Maximum-Finding Algorithms

Jan K. Pachl; E. Korach; D. Rotem

doi:10.1145/1634.1889

Lower Bounds for Distributed Maximum-Finding Algorithms

Jan K. Pachl, E. Korach, D. Rotem

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

52 Scopus citations

Abstract

Tills paper establishes several lower bounds of the form Ω(nlogn) for the number of messages needed to find the maximum label in a circular configuration of n labeled processes with no central controller.

Original language	English
Pages (from-to)	905-918
Number of pages	14
Journal	Journal of the ACM
Volume	31
Issue number	4
DOIs	https://doi.org/10.1145/1634.1889
State	Published - 20 Sep 1984
Externally published	Yes

ASJC Scopus subject areas

Software
Control and Systems Engineering
Information Systems
Hardware and Architecture
Artificial Intelligence

Access to Document

10.1145/1634.1889

Cite this

@article{1ae36b19861a4770b1da1598a08b1f3a,

title = "Lower Bounds for Distributed Maximum-Finding Algorithms",

abstract = "Tills paper establishes several lower bounds of the form Ω(nlogn) for the number of messages needed to find the maximum label in a circular configuration of n labeled processes with no central controller.",

author = "Pachl, {Jan K.} and E. Korach and D. Rotem",

year = "1984",

month = sep,

day = "20",

doi = "10.1145/1634.1889",

language = "English",

volume = "31",

pages = "905--918",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "4",

}

TY - JOUR

T1 - Lower Bounds for Distributed Maximum-Finding Algorithms

AU - Pachl, Jan K.

AU - Korach, E.

AU - Rotem, D.

PY - 1984/9/20

Y1 - 1984/9/20

N2 - Tills paper establishes several lower bounds of the form Ω(nlogn) for the number of messages needed to find the maximum label in a circular configuration of n labeled processes with no central controller.

AB - Tills paper establishes several lower bounds of the form Ω(nlogn) for the number of messages needed to find the maximum label in a circular configuration of n labeled processes with no central controller.

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

U2 - 10.1145/1634.1889

DO - 10.1145/1634.1889

M3 - Article

AN - SCOPUS:0021508575

VL - 31

SP - 905

EP - 918

JO - Journal of the ACM

JF - Journal of the ACM

SN - 0004-5411

IS - 4

ER -

Lower Bounds for Distributed Maximum-Finding Algorithms

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this