OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES

DOI10.1080/10637199308915441MaRDI QIDQ4819965zbMATH OpenOpenAlexFDO

Authors Ömer Eğecioğlu, A. Srinivasan

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199308915441

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer system organization (68M99)

Cites work

• scientific article; zbMATH DE number 53193 (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
• Parallel prefix computation with few processors
• The Complexity of Parallel Evaluation of Linear Recurrences

Cited in

(2)

• Parallel prefix computation on extended multi-mesh network.
• Fast parallel algorithm for prefix computation in multi-mesh architecture

This page was built for publication: OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819965)