GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
Algorithmic skeletons: structured management of parallel computation
Algorithmic skeletons: structured management of parallel computation
SIAM Journal on Scientific and Statistical Computing
A methodology for the development and the support of massively parallel programs
Future Generation Computer Systems - Special triple issue: parallel and distributed workstation systems
Structured development of parallel programs
Structured development of parallel programs
Parallel Programming Using Skeleton Functions
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Patterns and skeletons for parallel and distributed computing
Patterns and skeletons for parallel and distributed computing
A survey of algorithmic skeleton frameworks: high-level structured parallel programming enablers
Software—Practice & Experience - Focus on Selected PhD Literature Reviews in the Practical Aspects of Software Technology
| Hi-index | 0.00 |
Domain decomposition methods are numerically efficient for the simulation of large scale phenomena; in addition, these algorithms are naturally parallel and feature a good localization of data. Skeleton programming is a high level method for specifying the parallel structure of a program. We describe a full-fledged application of domain decomposition to a three-dimensional flow simulation problem and we express its parallel coordination code with skeleton programming in the purely functional setting of OCamlP31. We detail the OCamlP31 skeletons (including the new parfun and pardo), their typing, informal semantics, and definition as stream processors. To summarize, functional programming and skeleton programming appear to be an efficient and convenient framework to develop such parallel numerical applications.