Parallel prefix computation with few processors
From MaRDI portal
Publication:1205906
DOI10.1016/0898-1221(92)90009-7zbMath0800.68433OpenAlexW2018677560MaRDI QIDQ1205906
Ömer Eğecioğlu, Çetin Kaya Koç
Publication date: 1 April 1993
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(92)90009-7
Boolean operationdistributed-memory multiprocessorparallel prefix algorithmfloating-point matrix multiplicationprefix problem
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Optimal computation of prefix sums on a binary tree of processors
- Parallel Hermite interpolation: An algebraic approach
- Efficient parallel algorithms for linear recurrence computation
- A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors
- Depth-size trade-offs for parallel prefix computation
- Parallel Prefix Computation
- A Regular Layout for Parallel Adders
- The Complexity of Parallel Evaluation of Linear Recurrences
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
This page was built for publication: Parallel prefix computation with few processors
