Systematic Development of Correct Bulk Synchronous Parallel Programs

Abstract : 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.
Document type :
Conference papers
The 11th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT2010), The 11th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT2010) proceedings, Dec 2010, Wuhan, Chine, Singapore. IEEE, pp._, 2010
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00512867
Contributor : Julien Tesson <>
Submitted on : Tuesday, August 31, 2010 - 10:27:00 PM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM

Identifiers

  • HAL Id : hal-00512867, version 1

Collections

Citation

Louis Gesbert, Zhenjiang Hu, Frédéric Loulergue, Kiminori Matsuzaki, Julien Tesson. Systematic Development of Correct Bulk Synchronous Parallel Programs. The 11th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT2010), The 11th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT2010) proceedings, Dec 2010, Wuhan, Chine, Singapore. IEEE, pp._, 2010. 〈hal-00512867〉

Share

Metrics

Record views

99