TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK*
From MaRDI portal
Publication:2744172
DOI10.1080/01495730108935268zbMath1021.68026OpenAlexW2178923807WikidataQ126251003 ScholiaQ126251003MaRDI QIDQ2744172
Christian Lengauer, Susanna Pelagatti, Marco Aldinucci, Sergei Gorlatch
Publication date: 19 September 2001
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01495730108935268
Related Items (3)
Costing stepwise refinements of parallel programs ⋮ Skeleton-based parallel programming: functional and parallel semantics in a single shot ⋮ Hume box calculus: Robust system development through software transformation
Cites Work
- Unnamed Item
- On the subtree isomorphism problem for ordered trees
- On linear list recursion in parallel
- Applications of a strategy for designing divide-and-conquer algorithms
- A cost calculus for parallel functional programming
- Pattern Matching in Trees
- On the Design and Development of Program Families
- Parallelization of divide-and-conquer by translation to nested loops
This page was built for publication: TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK*