Cost Hierarchies for Abstract Parallel Machines

O'Donnell, John T.; Rauber, Thomas; Rünger, Gudula

doi:10.1007/3-540-45574-4_2

Cited by 2 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is worth noting that the idea of using formal approaches for transforming abstract specifications into concrete implementations was also proposed as abstract parallel machines in [21]. Compared with the study, the contribution of the paper is that we proposed and realized a concrete framework based on the Coq proof assistant and the BSP model.…”

Section: Programs Extraction and Experimentsmentioning

confidence: 99%

Systematic Development of Correct Bulk Synchronous Parallel Programs

Gesbert¹,

Loulergue³

et al. 2010

2010 International Conference on Parallel and Distributed Computing, Applications and Technologies

View full text Add to dashboard Cite

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.

show abstract

Section: Programs Extraction and Experimentsmentioning

confidence: 99%