Functional and dynamic programming in the design of parallel prefix networks

DOI10.1017/S0956796810000304MaRDI QIDQ3021416zbMATH OpenFDO

Authors Mary Sheeran

Publication date 25 July 2011

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796810000304

zbMATH Keywords

parallel prefix network design

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Mathematics of Program Construction
• scientific article; zbMATH DE number 1307000
• Parallel Prefix Computation
• Depth-size trade-offs for parallel prefix computation
• scientific article; zbMATH DE number 809141

Cites work

• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
• Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit
• Faster optimal parallel prefix circuits: new algorithmic construction
• Finding optimal parallel prefix circuits with fan-out 2 in constant time
• Parallel Prefix Computation
• The complexity of computations by networks

Cited in

(2)

• Much ado about two (pearl), a pearl on parallel prefix computation
• scientific article; zbMATH DE number 1307000 (Why is no real title available?)

Describes a project that uses

Uses Software

• SPIRAL

This page was built for publication: Functional and dynamic programming in the design of parallel prefix networks

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