Variants of Mersenne Twister suitable for Graphic Processors

ACM Transactions on Mathematical Software

Volumn 39, Issue 2, 2013, Pages

  Saito, Mutsuo ^a   Matsumoto, Makoto ^b  

^a HIROSHIMA UNIVERSITY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Dynamic creator; General purpose computing on graphics processing units; Mersenne Twister; Pseudo random number generator

Indexed keywords

EQUIDISTRIBUTION; GRAPHIC PROCESSORS; GRAPHICS PROCESSING UNIT; HIGH-DIMENSIONAL; LINEAR RECURSION; MERSENNE TWISTERS; PSEUDO RANDOM NUMBER GENERATORS; RANDOM NUMBERS;

COMPUTER GRAPHICS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS;

RANDOM NUMBER GENERATION;

EID: 84875139814     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/2427023.2427029     Document Type: Article

References (29)

1. Anderson, S. 1990. Random number generators on vector supercomputers and other advanced architectures. SIAM Rev. 32, 2, 221-251.
2. Couture, R., L'Ecuyer, P., and Tezuka, S. 1993. On the distribution of k-dimensional vectors for simple and combined Tausworthe sequences. Math. Comput. 60, 202, 749-761.
3. Fabien. 2011. XORWOW L'Ecuyer TestU01 results. http://chasethedevil. blogspot.com/2011/01/xorwowlecuyer-testu01-results.html.
4. Haramoto, H., Matsumoto, M., Nishimura, T., Panneton, F., and L'Ecuyer, P. 2008. Efficient jump ahead for F2-linear random number generators. INFORMS J. Comput. 20, 3, 385-390.
5. Harase, S. 2009. Maximally equidistributed pseudorandom number generators via linear output transformations. Math. Comput. Simul. 79, 5, 1512-1519.
6. Harase, S. 2011. An efficient lattice reduction method for F2-linear pseudorandom number generators using Mulders and Storjohann algorithm. J. Comput. Appl. Math. 236, 2, 141-149.
7. Harase, S., Matsumoto, M., and Saito, M. 2011. Fast lattice reduction for F2-linear pseudorandom number generators. Math. Comput. 80, 395-407.
8. Howes, L. and Thomas, D. 2009. Efficient random number generation and application using CUDA. http://http.developer.nvidia.com/GPUGems3/gpugems3-ch37. html.
9. Khronos Group. 2012. OpenCL. http://www.khronos.org/opencl/.
10. Knuth, D. E. 1997. The Art of Computer Programming. Vol.2., Seminumerical Algorithms 3rd Ed. Addison- Wesley, Reading, MA.
11. Langdon, W. B. 2009. A fast high quality pseudo random number generator for nVidia CUDA. In Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO'09). ACM, New York.
12. L'Ecuyer, P. 1996. Maximally equidistributed combined Tausworthe generators. Math. Comput. 65, 213, 203-213.
13. L'Ecuyer, P. and Panneton, F. 2009. F2-linear random number generators. In Advancing the Frontiers of Simulation: A Festschrift in Honor of George Samuel Fishman. C. Alexopoulos, D. Goldsman, and J. R. Wilson Eds., Springer, 175-200.
14. L'Ecuyer, P. and Simard, R. 2007. TestU01: A C library for empirical testing of random number generators. ACM Trans. Math. Softw. 33, 4, Article 22.
15. Luebke, D., Harris, M., Govindaraju, N., Lefohn, A., Houston, M., Owens, J., Segal, M., Papakipos, M., and Buck, I. 2008. GPGPU: General-purpose computation on graphics hardware. In Proceedings of the ACM/IEEE Conference on Supercomputing. ACM, New York.
16. Marsaglia, G. 2003. Xorshift RNGs. J. Stat. Softw. 8, 14, 1-6.
17. Matsumoto, M. and Nishimura, T. 1998. Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans. Model. Comput. Simul. 8, 1, 3-30.
18. Matsumoto, M. and Nishimura, T. 2000. Dynamic creation of pseudorandom number. In Monte Carlo and Quasi-Monte Carlo Methods. Springer, 56-69.
19. NVIDIA. 2010. CURAND library. http://developer.download.nvidia.com/ compute/cuda/3-2/toolkit/docs/CURAND Library.pdf.
20. NVIDIA Corp. 2007. NVIDIA CUDA Compute Unified Device Architecture Programming Guide. Ver 1.0 1.0 Ed. NVIDIA, Santa Clara, CA 95050.
21. NVIDIA Corp. 2009a. CUDA SDK code samples. http://developer.nvidia.com/ object/cudasdksamples.html.
22. NVIDIA Corp. 2009b. NVIDIA CUDA Programming Guide. Ver 2.3.1 2.3.1 Ed. NVIDIA, Santa Clara, CA 95050.
23. Panneton, F., L'Ecuyer, P., and Matsumoto, M. 2006. Improved long-period generators based on linear reccurences modulo 2. ACM Trans. Math. Softw. 32, 1, 1-16.
24. Passerat-Palmbach, J., Mazel, C., Mahul, A., and Hill, D. 2010. Reliable initialization of GPU-enabled parallel stochastic simulations using mersenne twister for graphics processors. In Proceedings of the European Simulation Conference.
25. Saito, M. and Matsumoto, M. 2008. SIMD-oriented fast Mersenne twister: A 128-bit pseudorandom number generator. In Monte Carlo and Quasi-Monte Carlo Methods. Springer, 607-622.
26. Saito, M. and Matsumoto, M. 2009. A PRNG specialized in double precision floating point number using an affine transition. In Monte Carlo and Quasi-Monte Carlo Methods. Springer-Verlag, 589-602.
27. Shoup, V. 1990. NTL: A library for doing number theory. http://www.shoup.net/ntl/.
28. Thomas, D. 2010. Uniform random number generators for GPUs. http://www.doc.ic.ac.uk/~dt10/research/rngs-gpu-uniform.html.
29. Tian, X. and Benkrid, K. 2009. Mersenne twister random number generation on FPGA, CPU and GPU. In Proceedings of the Adaptive Hardware and Systems Conference. IEEE, 460-464.