Parallel prefix computation with few processors

DOI10.1016/0898-1221(92)90009-7MaRDI QIDQ1205906zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Boolean operationdistributed-memory multiprocessorparallel prefix algorithmfloating-point matrix multiplicationprefix problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) General theory of computer systems (68M01)

Cites work

• scientific article; zbMATH DE number 4155887 (Why is no real title available?)
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
• A Regular Layout for Parallel Adders
• A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors
• An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
• Depth-size trade-offs for parallel prefix computation
• Efficient parallel algorithms for linear recurrence computation
• Optimal computation of prefix sums on a binary tree of processors
• Parallel Hermite interpolation: An algebraic approach
• Parallel Prefix Computation
• The Complexity of Parallel Evaluation of Linear Recurrences

Cited in

(1)

• OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES

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)