A random number generator for parallel computers (Q1200992): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:58, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A random number generator for parallel computers |
scientific article |
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
