A compositional framework for developing parallel programs on two-dimensional arrays
From MaRDI portal
Publication:2460097
DOI10.1007/s10766-007-0043-4zbMath1125.68036OpenAlexW4240732598MaRDI QIDQ2460097
Kazuhiko Kakehi, Masato Takeichi, Zhenjiang Hu, Kento Emoto
Publication date: 14 November 2007
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10766-007-0043-4
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Parallel algorithms in computer science (68W10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel implementation of tree skeletons
- Efficient parallel algorithms for tree accumulations
- Undulant-block elimination and integer-preserving matrix inversion
- A compositional framework for developing parallel programs on two-dimensional arrays
- Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
- Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
- Foundations of Parallel Programming
- Euro-Par 2004 Parallel Processing
- Programming Languages and Systems
- The Design of APL
