HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Generating Random Permutations in the Framework of Parallel Coarse Grained Models

Isabelle Guérin Lassous 1 Eric Thierry
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : We present three algorithms for generating random permutations in the coarse grained model CGM. For each of the proposed algorithms, we study the number of supersteps, the size of the local memory, the overall communicat- ion cost and we check if it gives a permutation with the uniform distribution or not. The proposed algorithms are intended to be simple and of practical relevance. The difficulty, in this paper, lies in proving that they are the desired properties.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:49:22 AM
Last modification on : Friday, February 4, 2022 - 3:08:04 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:51:13 PM


  • HAL Id : inria-00072758, version 1



Isabelle Guérin Lassous, Eric Thierry. Generating Random Permutations in the Framework of Parallel Coarse Grained Models. [Research Report] RR-3896, INRIA. 2000. ⟨inria-00072758⟩



Record views


Files downloads