Formal Derivation and Extraction of a Parallel Program for the All Nearest Smaller Values Problem

Frédéric Loulergue (1) , Simon Robillard (2) , Julien Tesson (3) , Joeffrey Legaux (2) , Zhenjiang Hu (4, 5)

1 PaMDA
2 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
3 LACL - Laboratoire d'Algorithmique Complexité et Logique
4 GRACE Center
5 IPL - Information Processsing Laboratory

The All Nearest Smaller Values (ANSV) problem is an important problem for parallel programming as it can be used to solve several problems and is one of the phases of several other parallel algorithms. We formally develop by construction a functional parallel program for solving the ANSV problem using the theory of Bulk Synchronous Parallel (BSP) homomorphisms within the Coq proof assistant. The performances of the Bulk Synchronous Parallel ML program obtained from Coq is compared to a version derived without software support (pen-and-paper) and implemented using the Orléans Skeleton Library of algorithmic skeletons, and to a (unproved correct) direct implementation of the BSP algorithm of He and Huang.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Frédéric Loulergue, Simon Robillard, Julien Tesson, Joeffrey Legaux, Zhenjiang Hu. Formal Derivation and Extraction of a Parallel Program for the All Nearest Smaller Values Problem. ACM Symposium on Applied Computing (SAC), 2014, Gyeongju, South Korea. ⟨hal-00905950⟩