SIMD-oriented fast mersenne twister: A 128-bit pseudorandom number generator

Monte Carlo and Quasi-Monte Carlo Methods 2006

Volumn , Issue , 2008, Pages 607-622

  Saito, Mutsuo ^a   Matsumoto, Makoto ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); NUMBER THEORY; PERSONAL COMPUTERS; PIPELINES; PROGRAM PROCESSORS; RANDOM NUMBER GENERATION;

EQUIDISTRIBUTION; MERSENNE TWISTERS; MULTI STAGE; PIPELINE PROCESSING; PSEUDO RANDOM NUMBER GENERATORS; RECURSIONS; SIMD OPERATIONS; SINGLE INSTRUCTION MULTIPLE DATA;

MONTE CARLO METHODS;

EID: 84892286857     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-74496-2_36     Document Type: Conference Paper

References (18)

1. [BZ03] R.P. Brent and P. Zimmermann. Random number generators with period divisible by a Mersenne prime. In Computational Science and its Applications -ICCSA 2003, volume 2667, pages 1-10, 2003.
2. [BZ04] R.P. Brent and P. Zimmermann. Algorithms for finding almost irreducible and almost primitive trinomials. Fields Inst. Commun., 41:91-102, 2004.
3. [CLT93] R. Couture, P. L'Ecuyer, and S. Tezuka. On the distribution of k-dimensional vectors for simple and combined Tausworthe sequences. Math. Comp., 60(202):749-761, 1993.
4. [Fus90] M. Fushimi. Random number generation with the recursion xt = xt-3p ?xt-3q. Journal of Computational and Applied Mathematics, 31:105-118, 1990.
5. [Knu97] D.E. Knuth. The Art of Computer Programming. Vol. 2. Seminumerical Algorithms. Addison-Wesley, Reading, Mass., 3rd edition, 1997.
6. [L'E93] P. L'Ecuyer. A search for good multiple recursive random number genarators. ACM Transactions on Modeling and Computer Simulation, 3(2):87-98, April 1993.
7. [L'E96] P. L'Ecuyer. Maximally equidistributed combined tausworthe generators. Math. Comp., 65(213):203-213, 1996.
8. [L'E99] P. L'Ecuyer. Tables of maximally equidistributed combined LFSR generators. Math. Comp., 68(225):261-269, 1999.
9. [LS06] P. L'Ecuyer and R. Simard. TestU01: A C library for empirical testing of random number generators. ACM Transactions on Mathematical Software, 2006. to appear.
10. [Mar03] G. Marsaglia. Xorshift RNGs. Journal of Statistical Software, 8(14):1-6, 2003.
11. [MN98] M. Matsumoto and T. Nishimura. Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans. on Modeling and Computer Simulation, 8(1):3-30, January 1998. http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html.
12. [MN02] M. Matsumoto and T. Nishimura. A nonempirical test on the weight of pseudorandom number generators. In Monte Carlo and Quasi-Monte Carlo methods 2000, pages 381-395. Springer-Verlag, 2002.
13. [MN03] M. Matsumoto and T. Nishimura. Sum-discrepancy test on pseudorandom number generators. Mathematics and Computers in Simulation, 62(3-6):431-442, 2003.
14. [PL05] F. Panneton and P. L'Ecuyer. On the Xorshift random number generators. ACM Transactions on Modeling and Computer Simulation, 15(4):346-361, 2005.
15. [PLM06] F. Panneton, P. L'Ecuyer, and M. Matsumoto. Improved long-period generators based on linear reccurences modulo 2. ACM Transactions on Mathematical Software, 32(1):1-16, 2006.
16. [SHP+06] M. Saito, H. Haramoto, F. Panneton, T. Nishimura, and M. Matsumoto. Pulmonary LFSR: pseudorandom number generators with multiple feedbacks and reducible transitions. 2006. submitted.
17. [SM] M. Saito and M. Matsumoto. SFMT Homepage. http://www.math.sci. hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html.
18. [Wik] Endianness from Wikipedia, the free encyclopedia. http://en.wikipedia.org/wiki/Endianness