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 | |
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