Algorithmic Completeness of BSP Languages

Abstract : The Bulk-Synchronous Parallel (BSP) bridging model is a candidate for a simple and practical definition for High Performance Computing (HPC) algorithms. These BSP algorithms have been axiomatized, then captured by the operational semantics of the BSP Abstract State Machines (ASM-BSP), an extension of the ASM model of Gurevich. In this technical report, we define a minimal imperative language While-BSP, and prove that this model of computation fairly simulates the executions of the ASM-BSP machines, and reciprocally that ASM-BSP simulates While-BSP. Therefore, While-BSP is algorithmically complete for the BSP algorithms, and so does usual programming languages like Pregel, or imperative languages using the BSPLIB library.
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01742406
Contributor : Yoann Marquer <>
Submitted on : Saturday, March 24, 2018 - 7:05:22 PM
Last modification on : Wednesday, December 19, 2018 - 3:50:03 PM
Document(s) archivé(s) le : Thursday, September 13, 2018 - 8:25:34 AM

File

BSP-While-long-1.pdf.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01742406, version 1

Collections

Citation

Yoann Marquer, Frédéric Gava. Algorithmic Completeness of BSP Languages. [Technical Report] Laboratoire d'Algorithmique, Complexité et Logique, Université Paris-Est Créteil. 2018. ⟨hal-01742406⟩

Share

Metrics

Record views

107

Files downloads

63