Algorithmic Completeness of BSP Languages - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport Technique) Année : 2018

Algorithmic Completeness of BSP Languages

Résumé

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.
Fichier principal
Vignette du fichier
BSP-While-long-1.pdf.pdf (459.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01742406 , version 1 (24-03-2018)

Identifiants

  • HAL Id : hal-01742406 , version 1

Citer

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⟩
121 Consultations
150 Téléchargements

Partager

Gmail Facebook X LinkedIn More