Conference proceeding
Optimal and efficient parallel algorithms for summing and prefix summing
8th IEEE Symposium on Parallel and Distributed Processing, (8th), pp 504-511
1996
Abstract
The author considers the problem of designing efficient parallel algorithms for summing and prefix summing. The author presents optimal algorithms for summing on a latency-dependent distributed-memory model and shows that any optimal summing algorithm must have an inherent structure. Moreover, the author presents optimal or near-optimal algorithms for prefix summing for both non-commutative and commutative binary operators. Furthermore, the author shows that the optimal algorithms for prefix summing for these two types of operators are not equivalent.
Metrics
1 Record Views
Details
- Title
- Optimal and efficient parallel algorithms for summing and prefix summing
- Creators
- E.E. Santos - Lehigh University
- Publication Details
- 8th IEEE Symposium on Parallel and Distributed Processing, (8th), pp 504-511
- Publisher
- IEEE
- Number of pages
- 8
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- School of Engineering
- Web of Science ID
- WOS:A1996BG88V00065
- Scopus ID
- 2-s2.0-0030420043
- Other Identifier
- 991022207145604721