Optimal computation of prefix sums on a binary tree of processors
- 1 April 1987
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 16 (2) , 127-136
- https://doi.org/10.1007/bf01379098
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The power of parallel prefixIEEE Transactions on Computers, 1985
- Binary Trees and Parallel Scheduling AlgorithmsIEEE Transactions on Computers, 1983
- New bounds for parallel prefix circuitsPublished by Association for Computing Machinery (ACM) ,1983
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Parallel Prefix ComputationJournal of the ACM, 1980
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- Parallel Solution of Recurrence ProblemsIBM Journal of Research and Development, 1974
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence EquationsIEEE Transactions on Computers, 1973