Implementing powerlists with Bulk Synchronous Parallel ML

Abstract : The latest developments of the computation systems impose using tools and methodologies able to simplify the development process of parallel software, but also to assure a high level of performance and robustness. Powerlists and their variants are data structures that can be successfully used in a simple, provably correct, functional description of parallel programs, which are divide and conquer in nature. They represent one of the high-level algebraic theories which are appropriate to be used as fundamentals for a model of parallel computation that assures correctness proving. The paper presents how programs defined based on powerlists could be transformed to real code in the functional language OCaml plus calls to the parallel functional programming library Bulk Synchronous Parallel ML. BSML functions follow the BSP model requirements, and so its advantages are introduced in OCaml parallel code. The transformations are based on a framework that assures: simple, correct, efficient implementation. Examples are given and concrete experiments for their executions are conducted. The results emphasise the utility and the efficiency of the framework.
Liste complète des métadonnées
Contributor : Frédéric Loulergue <>
Submitted on : Monday, January 19, 2015 - 5:34:01 PM
Last modification on : Thursday, January 17, 2019 - 3:06:06 PM




Frédéric Loulergue, Julien Tesson, Virginia Niculescu. Implementing powerlists with Bulk Synchronous Parallel ML. 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Sep 2014, Timisoara, Romania. IEEE, 2014, 〈10.1109/SYNASC.2014.51〉. 〈hal-01105115〉



Record views