The static parallelization of loops and recursions

DOI10.1023/A:1007904422322MaRDI QIDQ1375712zbMATH OpenOpenAlexFDO

Authors Christian Lengauer, S. Gorlatch, Christoph A. Herrmann

Publication date 12 January 1998

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1007904422322

zbMATH Keywords

divide-and-conquerpolynomial product

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Fine-grain parallelization of imperfectly nested loops
• On the parallel complexity of loops
• scientific article; zbMATH DE number 618313
• Parallelization of recurrent loops with conditional statements
• scientific article; zbMATH DE number 1693478
• Parallelization of divide-and-conquer by translation to nested loops

Cited in

(7)

• On serial and parallel implementations of the Erlang fixed-point iteration scheme
• scientific article; zbMATH DE number 5885666 (Why is no real title available?)
• Automatic parallelization of recursive functions using quantifier elimination
• Advanced Regular Array Design
• Parallelization of divide-and-conquer by translation to nested loops
• Paralleling iterative loops
• scientific article; zbMATH DE number 1079700 (Why is no real title available?)

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: The static parallelization of loops and recursions

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