Efficient jump ahead for F2-linear random number generators

INFORMS Journal on Computing

Volumn 20, Issue 3, 2008, Pages 385-390

  Haramoto, Hiroshi ^a   Matsumoto, Makoto ^a   Nishimura, Takuji ^b   Panneton, François ^c   L'Ecuyer, Pierre ^c  

^a HIROSHIMA UNIVERSITY   (Japan)

^b YAMAGATA UNIVERSITY   (Japan)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Jumping ahead; Multiple streams; Random number generation; Simulation

Indexed keywords

EID: 56449125084     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1070.0251     Document Type: Article

References (18)

1. Golub, G. H., C. F. Van Loan. 1996. Matrix Computations, 3rd ed. John Hopkins University Press, Baltimore.
2. Hellekalek, P. 1998. Don't trust parallel Monte Carlo! Twelfth Workshop on Parallel and Distributed Simulation, Banff, Canada. IEEE Computer Society, Los Alamitos, CA, 82-89.
3. Kelton, W. D. 2006. Implementing representations of uncertainty. S. G. Henderson, B. L. Nelson, eds. Simulation. Handbooks in Operations Research and Management Science, Chapter 7. Elsevier, Amsterdam, 181-191.
4. Knuth, D. E. 1998. The Art of Computer Programming, Seminumerical Algorithms, 3rd ed., Vol. 2. Addison-Wesley, Reading, MA.
5. Law, A. M., W. D. Kelton. 2000. Simulation Modeling and Analysis, 3rd ed. McGraw-Hill, New York.
6. L'Ecuyer, P. 1990. Random numbers for simulation. Comm. ACM 33 85-97.
7. L'Ecuyer, P., S. Côté. 1991. Implementing a random number package with splitting facilities. ACM Trans. Math. Software 17 98-111.
8. L'Ecuyer, P., F. Panneton. 2005. Fast random number generators based on linear recurrences modulo 2: Overview and comparison. Proc. 2005 Winter Simulation Conf., IEEE Press, Piscataway, NJ, 110-119.
9. L'Ecuyer, P., R. Simard, E. J. Chen, W. D. Kelton. 2002. An object- oriented random-number package with many long streams and substreams. Oper. Res. 50 1073-1075.
10. Matsumoto, M., T. Nishimura. 1998. Mersenne twister: A 623- dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simulation 8 3-30.
11. Möller, B. 2005. Sliding window exponentiation. H. C. A. van Tilborg, ed. Encyclopedia of Cryptography and Security. Springer-Verlag, New York, 588-590.
12. Nishimura, T. 2000, Tables of 64-bit Mersenne twisters. ACM Trans. Model. Comput. Simulation 10 348-357.
13. Panneton, F., P. L'Ecuyer. 2005. On the xorshift random number generators. ACM Trans. Model. Comput. Simulation 15 346-361.
14. Panneton, F., P. L'Ecuyer, M. Matsumoto. 2006. Improved long-period generators based on linear recurrences modulo 2. ACM Trans. Math. Software 32 1-16.
15. Saito, M., M. Matsumoto. 2008. SIMD-oriented fast Mersenne twister: A 128-bit pseudorandom number generator. S. Heinrich, A. Keller, H. Niederreiter, eds. Monte Carlo and Quasi-Monte Carlo Methods 2006. Springer-Verlag, Berlin, 617-632.
16. Savage, C. 1997. A survey of combinatorial Gray codes. SIAM Rev. 39 605-629.
17. Strang, G. 1988. Linear Algebra and Its Applications, 3rd ed. Saunders, Philadelphia.
18. Tezuka, S. 1995. Uniform Random Numbers: Theory and Practice. Kluwer Academic Publishers, Norwell, MA.