Programming with divide-and-conquer skeletons: A case study of FFT

DOI10.1023/A:1007981511582MaRDI QIDQ1386455zbMATH OpenFDO

Authors S. Gorlatch

Publication date 24 May 1998

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

Full work available at URL https://doi.org/10.1023/A:1007981511582

zbMATH Keywords

distributable homomorphismskeletons

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• scientific article; zbMATH DE number 2189117
• Efficient high-level parallel programming
• Parallelization of divide-and-conquer by translation to nested loops
• scientific article; zbMATH DE number 2090644
• scientific article; zbMATH DE number 43723

Cited in

(3)

• scientific article; zbMATH DE number 6611926 (Why is no real title available?)
• Parallelization of divide-and-conquer by translation to nested loops
• Costing stepwise refinements of parallel programs

This page was built for publication: Programming with divide-and-conquer skeletons: A case study of FFT

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