Domain decomposition and skeleton programming with OCamlP3l - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Parallel Computing Année : 2006

Domain decomposition and skeleton programming with OCamlP3l

Résumé

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 OCamlP3l. We detail the OCamlP3l 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.

Dates et versions

hal-00149564 , version 1 (26-05-2007)

Identifiants

Citer

François Clément, Vincent Martin, Arnaud Vodicka, Roberto Di Cosmo, Pierre Weis. Domain decomposition and skeleton programming with OCamlP3l. Parallel Computing, 2006, 32 (7-8), pp.539-550. ⟨10.1016/j.parco.2006.04.003⟩. ⟨hal-00149564⟩
74 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More