template metaprogramming

Repeatability with random numbers using algorithmic skeletons

This article presents a solution to ensure repeatability atsoftware level when using pseudorandom numbers in paral-lel computations. This is achieved automatically to ease thedeveloper, without inducing performance loss compared toa manual approach …

Algorithmic skeletons using template metaprogramming

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 …

Modeling algorithmic skeletons for automatic parallelization using template metaprogramming

This article presents a framework for algorithmic skeletons that aims at representing a whole algorithm, both its sequential and possibly parallelizable parts, in order to enable making global decisions about its implementation. With our modeling, a …