Abstract
The problem of designing efficient parallel algorithms for summing and prefix summing for certain classes of the LogP model is studied. We present optimal algorithms for summing and show that any optimal summing algorithm must have a certain inherent structure. Moreover, we present optimal or near-optimal algorithms for prefix summing for both non-commutative and commutative binary operators. Furthermore, we show that the optimal algorithms for prefix summing for these two types of operators are not equivalent.
Original language | English (US) |
---|---|
Pages (from-to) | 517-543 |
Number of pages | 27 |
Journal | Journal of Parallel and Distributed Computing |
Volume | 62 |
Issue number | 4 |
DOIs | |
State | Published - 2002 |
Externally published | Yes |
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence