Exact communication costs for consensus and leader in a tree

Yefim Dinitz; Shlomo Moran; Sergio Rajsbaum

doi:10.1016/S1570-8667(03)00024-8

Exact communication costs for consensus and leader in a tree

Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum

Department of Computer Science

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

7 Scopus citations

Abstract

We continue the study of communication costs of Consensus and Leader initiated in a previous paper. We deal with all scenarios with linear complexity in a tree topology, and prove exact (as opposed to asymptotic) tight bounds for the bit and message complexities. A particular scenario depends on whether the tree size or the size parity is known to the processors.

Original language	English
Pages (from-to)	167-183
Number of pages	17
Journal	Journal of Discrete Algorithms
Volume	1
Issue number	2
DOIs	https://doi.org/10.1016/S1570-8667(03)00024-8
State	Published - 1 Jan 2003

Keywords

BSP model
Broadcast
H-PRAM
Lower bounds
Parallel computing

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/S1570-8667(03)00024-8

Cite this

@article{2db9e03f620e44fea3d0b8923b0189fa,

title = "Exact communication costs for consensus and leader in a tree",

abstract = "We continue the study of communication costs of Consensus and Leader initiated in a previous paper. We deal with all scenarios with linear complexity in a tree topology, and prove exact (as opposed to asymptotic) tight bounds for the bit and message complexities. A particular scenario depends on whether the tree size or the size parity is known to the processors.",

keywords = "BSP model, Broadcast, H-PRAM, Lower bounds, Parallel computing",

author = "Yefim Dinitz and Shlomo Moran and Sergio Rajsbaum",

year = "2003",

month = jan,

day = "1",

doi = "10.1016/S1570-8667(03)00024-8",

language = "English",

volume = "1",

pages = "167--183",

journal = "Journal of Discrete Algorithms",

issn = "1570-8667",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Exact communication costs for consensus and leader in a tree

AU - Dinitz, Yefim

AU - Moran, Shlomo

AU - Rajsbaum, Sergio

PY - 2003/1/1

Y1 - 2003/1/1

N2 - We continue the study of communication costs of Consensus and Leader initiated in a previous paper. We deal with all scenarios with linear complexity in a tree topology, and prove exact (as opposed to asymptotic) tight bounds for the bit and message complexities. A particular scenario depends on whether the tree size or the size parity is known to the processors.

AB - We continue the study of communication costs of Consensus and Leader initiated in a previous paper. We deal with all scenarios with linear complexity in a tree topology, and prove exact (as opposed to asymptotic) tight bounds for the bit and message complexities. A particular scenario depends on whether the tree size or the size parity is known to the processors.

KW - BSP model

KW - Broadcast

KW - H-PRAM

KW - Lower bounds

KW - Parallel computing

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

U2 - 10.1016/S1570-8667(03)00024-8

DO - 10.1016/S1570-8667(03)00024-8

M3 - Article

AN - SCOPUS:24944571286

SN - 1570-8667

VL - 1

SP - 167

EP - 183

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

IS - 2

ER -

Exact communication costs for consensus and leader in a tree

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this