An ASM Thesis for BSP

Abstract : 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.
Liste complète des métadonnées

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01717647
Contributor : Yoann Marquer <>
Submitted on : Monday, February 26, 2018 - 3:46:52 PM
Last modification on : Wednesday, December 19, 2018 - 3:50:03 PM
Document(s) archivé(s) le : Monday, May 28, 2018 - 7:57:26 PM

File

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

Identifiers

  • HAL Id : hal-01717647, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

248

Files downloads

85