Repeatability with Random Numbers Using Algorithmic Skeletons - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Repeatability with Random Numbers Using Algorithmic Skeletons

Abstract

This article presents a solution to ensure repeatability at software level when using pseudorandom numbers in parallel computations. This is achieved automatically to ease the developer, without inducing performance loss compared to a manual approach thanks to template metaprogramming. Based on the data flow mechanism proposed in a previous work to design and execute algorithmic skeletons, we automate the correct usage of Pseudorandom Number Generator (PRNG) streams. This mechanism makes it possible to assign a PRNG stream to any part of an algorithm, and reaching repeatability can be done by providing the same random number sequence to any parallelizable task, whether it is in a parallel run, regardless of the degree of parallelism, or in a sequential one. Parallelizable tasks can easily be identified within algorithmic skeletons as they provide information about each component of their structure, accessible at compile-time. We illustrate our solution on a metaheuristic to solve an Operational Research (OR) problem that allows several levels of parallelism.
Fichier principal
Vignette du fichier
article.pdf (465.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02980472 , version 1 (01-04-2022)

Identifiers

  • HAL Id : hal-02980472 , version 1

Cite

Alexis Pereda, David R.C. Hill, Claude Mazel, Bruno Bachelet. Repeatability with Random Numbers Using Algorithmic Skeletons. 34th European Simulation and Modelling Conference (ESM), Oct 2020, Toulouse, France. pp.39-46. ⟨hal-02980472⟩
108 View
26 Download

Share

Gmail Facebook X LinkedIn More