Systematic Development of Correct Bulk Synchronous Parallel Programs

With the current generalisation of parallel architectures arises the concern of applying formal methods to parallelism. The complexity of parallel, compared to sequential, programs makes them more error-prone and difficult to verify. Bulk Synchronous Parallelism (BSP) is a model of computation which...

Full description

Saved in:
Bibliographic Details
Published in:2010 International Conference on Parallel and Distributed Computing, Applications and Technologies pp. 334 - 340
Main Authors: Gesbert, L, Zhenjiang Hu, Loulergue, Frédéric, Matsuzaki, K, Tesson, J
Format: Conference Proceeding
Language:English
Japanese
Published: IEEE 01.12.2010
Subjects:
Computational modeling
Homomorphic skeleton
Parallel functional programming
Parallel processing
Poles and towers
Program derivation
Program processors
Proof assistant
Semantics
Skeleton
Systematics
ISBN:142449110X, 9781424491100
ISSN:2379-5352
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the current generalisation of parallel architectures arises the concern of applying formal methods to parallelism. The complexity of parallel, compared to sequential, programs makes them more error-prone and difficult to verify. Bulk Synchronous Parallelism (BSP) is a model of computation which offers a high degree of abstraction like PRAM models but yet a realistic cost model based on a structured parallelism. We propose a framework for refining a sequential specification toward a functional BSP program, the whole process being done with the help of the Coq proof assistant. To do so we define BH, a new homomorphic skeleton, which captures the essence of BSP computation in an algorithmic level, and also serves as a bridge in mapping from high level specification to low level BSP parallel programs.
ISBN:142449110X
9781424491100
ISSN:2379-5352
DOI:10.1109/PDCAT.2010.86