An ASM Thesis for BSP - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport Technique) Année : 2018

An ASM Thesis for BSP

Résumé

The gurevich's thesis stipulates that sequential abstract state machines (asms) capture the essence of sequential algorithms. On another side, the bulk-synchronous parallel (bsp) bridging model is a well known model for hpc algorithm design. It provides a conceptual bridge between the physical implementation of the machine and the abstraction available to a programmer of that machine. The assumptions of the bsp model are thus provide portable and scalable performance predictions on hpc systems. We follow gurevich's thesis and extend the sequential postulates in order to intuitively and realistically characterise the bsp algorithms.
Fichier principal
Vignette du fichier
BSP-ASM-long-1.pdf (669.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01717647 , version 1 (26-02-2018)

Identifiants

  • HAL Id : hal-01717647 , version 1

Citer

Yoann Marquer, Frédéric Gava. An ASM Thesis for BSP. [Technical Report] Laboratoire d'Algorithmique, Complexité et Logique, Université Paris-Est Créteil. 2018. ⟨hal-01717647⟩
244 Consultations
111 Téléchargements

Partager

Gmail Facebook X LinkedIn More