Parallelization of divide-and-conquer by translation to nested loops

DOI10.1017/S0956796899003287MaRDI QIDQ4934239zbMATH OpenOpenAlexWikidataFDO

Authors Christoph A. Herrmann, Christian Lengauer

Publication date 17 January 2000

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

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

zbMATH Keywords

equational reasoning in Haskell

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Parallelization of divide-and-conquer in the Bird-Meertens formalism
• Programming with divide-and-conquer skeletons: A case study of FFT
• Massive parallelization of divide-and-conquer algorithms over powerlists
• The static parallelization of loops and recursions
• A data-parallel formulation for divide and conquer algorithms

Cited in

(6)

• The static parallelization of loops and recursions
• Programming with divide-and-conquer skeletons: A case study of FFT
• Parallelization of divide-and-conquer in the Bird-Meertens formalism
• TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK*
• scientific article; zbMATH DE number 5353986 (Why is no real title available?)
• scientific article; zbMATH DE number 1760062 (Why is no real title available?)

This page was built for publication: Parallelization of divide-and-conquer by translation to nested loops

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