Algorithmic Skeletons Using Template Metaprogramming - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Algorithmic Skeletons Using Template Metaprogramming

(1) , (1) , (1) , (1)


Algorithmic skeletons, introduced by Cole, were designed to ease the development of parallel software. This article presents a way to represent and implement algorithmic skeletons using bones - atomic elements - to build structures, and data flow graphs to link the structures. We design and implement a library relying on Template Metaprogramming (TMP) to describe and use both skeletons and links to produce automatically either a sequential or a parallel implementation of the algorithm, aiming slight to no run-time overhead compared to handwritten implementations. Performance results of this library, applied to metaheuristics in Operations Research (OR), are presented to show that this approach induces negligible run-time overhead.
Fichier principal
Vignette du fichier
icast2019_article.pdf (252.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02573826 , version 1 (14-05-2020)
hal-02573826 , version 2 (18-12-2020)


  • HAL Id : hal-02573826 , version 2


Alexis Pereda, David R.C. Hill, Claude Mazel, Bruno Bachelet. Algorithmic Skeletons Using Template Metaprogramming. 14th International Student Conference on Advanced Science and Technology (ICAST), Nov 2019, Kumamoto, Japan. pp.204-205. ⟨hal-02573826v2⟩
99 View
75 Download


Gmail Facebook Twitter LinkedIn More