A random number generator for parallel computers (Q1200992)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A random number generator for parallel computers |
scientific article; zbMATH DE number 97036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A random number generator for parallel computers |
scientific article; zbMATH DE number 97036 |
Statements
A random number generator for parallel computers (English)
0 references
17 January 1993
0 references
An efficient parallelization of the generalized feedback shift register (GFSR) random number generator is presented. GFSR works on \(N=2^ m\) processors as a set of generators. The \(i\)-th generator produces the subsequence \(x_ i,x_{i+N}, x_{i+2N},\dots\) where \(x_ 0,x_ 1,x_ 2,x_ 3,\dots\) is the sequence generated by a nonparallel GFSR generator.
0 references
parallel computing
0 references
generalized feedback shift register random number generator
0 references
parallel random number generator
0 references
GFSR algorithm
0 references
primitive trinomial
0 references
leapfrog technique
0 references
0.8851271271705627
0 references
0.851194441318512
0 references
0.849395215511322
0 references
0.848174512386322
0 references
