Formal Derivation and Extraction of a Parallel Program for the All Nearest Smaller Values Problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

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

Abstract

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.
No file

Dates and versions

hal-00905950 , version 1 (19-11-2013)

Identifiers

  • HAL Id : hal-00905950 , version 1

Cite

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⟩
169 View
0 Download

Share

Gmail Facebook X LinkedIn More