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

DOI10.1023/A:1007981511582zbMath0896.68032MaRDI QIDQ1386455

Sergei Gorlatch

Publication date: 24 May 1998

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

zbMATH Keywords

skeletonsdistributable homomorphism

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items

Costing stepwise refinements of parallel programs

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