Parallelization techniques for random number generators

GPU Computing Gems Emerald Edition

Volumn , Issue , 2011, Pages 231-246

  Bradley, Thomas ^a   du Toit, Jacques ^b   Tong, Robert ^b   Giles, Mike ^c   Woodhams, Paul ^b  

^a NVIDIA   (United States)

^b Numerical Algorithms Group   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT SYSTEMS; MONTE CARLO METHODS; NUMBER THEORY;

COMPUTATIONAL FINANCE; COMPUTATIONAL SCIENCE AND ENGINEERINGS; DATA DEPENDENCIES; MATHEMATICAL FORMULATION; PARALLEL MONTE CARLO SIMULATION; PARALLELIZATION TECHNIQUES; RANDOM NUMBER GENERATORS; SEQUENTIAL ALGORITHM;

RANDOM NUMBER GENERATION;

EID: 84875452684     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-0-12-384988-5.00016-4     Document Type: Chapter

References (12)

1. τ sequences. USSR J. Comput. Math. Math. Phys. 1979, 19:252-256.
2. Bratley P., Fox B. Algorithm 659: implementing Sobol's quasirandom sequence generator. ACM Trans. Model. Comput. Simul. 1988, 14(1):88-100.
3. L'Ecuyer P. Uniform random number generation. Simulation Handbooks in Operation Research and Management Science 2006, 55-81. Elsevier Inc., Amsterdam. S.G. Henderson, B.L. Nelson (Eds.).
4. L'Ecuyer P. Good parameter sets for combined multiple recursive random number generators. Ops. Rsch. 1999, 47(1):159-164.
5. L'Ecuyer P., Simar R., Chen E.J., Kelton W.D. An object oriented random number package with many long streams and substreams. Ops. Rsch. 2002, 50(6):1073-1075.
6. M. Giles, Approximating the erfinv function, in: GPU Gems 4, vol. 2.
7. S. Gueron, M.E. Kounavis, Intel carry-less multiplication instruction and its usage for computing the GCM mode, Intel White Paper, http://software.intel.com/en-us/articles/intel-carry-less-multiplication -instruction-and-its-usage-for-computing-the-gcm-mode/. http://software.intel.com/en-us/articles/intel-carry-less-multiplication -instruction-and-its-usage-for-computing-the-gcm-mode/.
8. Knuth D. The Art of Computer Programming 1997, vol. 2. Addison-Wesley Professional, Reading, MA. third ed.
9. Haromoto H., Matsumoto M., Nishumira T., Panneton F., L'Ecuyer P. Efficient jump ahead for F2-linear random number generators. INFORMS J. Comput. 2008, 20(3):385-390.
10. Joe S., Kuo F.Y. Constructing Sobol sequences with better two dimensional projects. SIAM J. Sci. Comput. 2008, 30:2635-2654.
11. Matsumoto M., Nishumira T. Mersenne Twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Mod. Comput. Simul. 1998, 8(1):3-30.
12. Sobol I.M. On the distribution of points in a cube and the approximate evaluation of integrals. USSR Comput. Math. Math. Phys. 1967, 16:1332-1337.