Optimal Broadcast and Summation in the LogP Model

Authors:
Richard M. Karp;Abhijit Sahay;Eunice Santos
Affiliations:
-;-;-
Venue:
Optimal Broadcast and Summation in the LogP Model
Year:
1992

Citing 0
Cited 2

LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A high-performance communication service for parallel computing on distributed DSP systems

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider several natural broadcasting problems for the LogP model of distributed memory machines recently proposed by Culler et al. For each of these problems, we present algorithms that yield an optimal communication schedule. Our algorithms are absolutely best possible in that not even the constant factors can be improved upon. We also devise an (absolutely) optimal algorithm for summing a list of elements (using a non- commutative operation) using one of the optimal broadcast algorithms.