Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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).
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03189898
Contributor : Yoann Marquer Connect in order to contact the contributor
Submitted on : Monday, April 5, 2021 - 1:33:07 PM
Last modification on : Wednesday, November 3, 2021 - 6:47:44 AM
Long-term archiving on: : Tuesday, July 6, 2021 - 6:04:11 PM

File

2020_IJPP_MultiBSP.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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, Springer Verlag, 2020, 48 (4), pp.626-651. ⟨10.1007/s10766-020-00669-9⟩. ⟨hal-03189898⟩

Share

Metrics

Record views

19

Files downloads

54