Parallel processing of random number generation for Monte Carlo turbulence simulation (Q1116628)
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: Parallel processing of random number generation for Monte Carlo turbulence simulation |
scientific article; zbMATH DE number 4090660
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel processing of random number generation for Monte Carlo turbulence simulation |
scientific article; zbMATH DE number 4090660 |
Statements
Parallel processing of random number generation for Monte Carlo turbulence simulation (English)
0 references
1989
0 references
In Monte Carlo computations on multi-processor computers used as a model for drift-wave turbulence in plasma physics, pseudo-random numbers generators with the following characteristics are requested: 1) numbers given to each processor should be disjoint sets; 2) the sets are reproducible run to run; and 3) the sets of numbers are the same as those obtained by using the same random number generator on computers with different numbers of processors. A simple method is given for generating reproducible sets of pseudo-random numbers with these characteristics. The method employs hopping through the sequence at large equal interval. The relation with the leapfrog method [\textit{K. O. Bowman} and \textit{M. T. Robinson}, Proc. Second. Conf. Hypercube Multiprocessors, SIAM 445 (1987)] is mentioned.
0 references
Monte Carlo computations
0 references
multi-processor computers
0 references
drift-wave turbulence
0 references
plasma physics
0 references
pseudo-random numbers generators
0 references
hopping
0 references
leapfrog method
0 references