Parallel prefix computation with few processors
DOI10.1016/0898-1221(92)90009-7zbMATH Open0800.68433OpenAlexW2018677560MaRDI QIDQ1205906FDOQ1205906
Authors: Ö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
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) General theory of computer systems (68M01)
Cites Work
- Parallel Prefix Computation
- A Regular Layout for Parallel Adders
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
- Efficient parallel algorithms for linear recurrence computation
- Title not available (Why is that?)
- Depth-size trade-offs for parallel prefix computation
- Parallel Hermite interpolation: An algebraic approach
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
- The Complexity of Parallel Evaluation of Linear Recurrences
- A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors
- Optimal computation of prefix sums on a binary tree of processors
Cited In (1)
This page was built for publication: Parallel prefix computation with few processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205906)