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

DOI10.1017/S0956796899003287zbMATH Open0948.68228OpenAlexW2021790219WikidataQ128011516 ScholiaQ128011516MaRDI QIDQ4934239FDOQ4934239

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

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

zbMATH Keywords

equational reasoning in Haskell

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (5)

• Title not available (Why is that?)
• TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK*
• Title not available (Why is that?)
• Parallelization of divide-and-conquer in the Bird-Meertens formalism
• The static parallelization of loops and recursions

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)