Axiomatization and Imperative Characterization of Multi-BSP Algorithms: A Q&A on a Partial Solution - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Parallel Programming Année : 2020

Axiomatization and Imperative Characterization of Multi-BSP Algorithms: A Q&A on a Partial Solution

Résumé

multi-bsp is a new bridging model which takes into account hierarchical architectures. We discuss two questions about multi-bsp algorithms and their programming: (1) How do we get a formal characterization of the class of multi-bsp algorithms? (2) How can a programming language be proven algorithmically complete for such a class? Our solution is based on an extension of a bsp version of sequential abstract state machines (asms).
Fichier principal
Vignette du fichier
2020_IJPP_MultiBSP.pdf (576.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03189898 , version 1 (05-04-2021)

Identifiants

Citer

Frédéric Gava, Yoann Marquer. Axiomatization and Imperative Characterization of Multi-BSP Algorithms: A Q&A on a Partial Solution. International Journal of Parallel Programming, 2020, 48 (4), pp.626-651. ⟨10.1007/s10766-020-00669-9⟩. ⟨hal-03189898⟩

Collections

LACL UPEC
34 Consultations
94 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More