Parallel Random Number Generators Based on Large Order Multiple Recursive Generators

Classical random number generators like Linear Congruential Generators (LCG) and Multiple Recursive Generators (MRG) are popular for large-scale simulation studies. To speed up the simulation process, a systematic method is needed to construct and parallelize the random number generators so that they can run simultaneously on several computers or processors. LCGs and MRGs have served as baseline generators for some parallel random number generator (PRNG) constructed in the literature. In this paper, we consider the parallelization problem particularly for a general class of efficient and portable large-order MRGs, in which most coefficients of the recurrence equation are nonzero. With many nonzero terms, such MRGs have an advantage over the MRGs with just a few nonzero terms that they can recover more quickly from a bad initialization. With the special structure imposed on the nonzero coefficients of the new class of generators, the proposed PRNGs can be implemented efficiently. A method of automatic generation of the corresponding MRGs for parallel computation is presented.

[1]  Pierre L'Ecuyer,et al.  Random numbers for simulation , 1990, CACM.

[2]  Pierre L'Ecuyer,et al.  Improved long-period generators based on linear recurrences modulo 2 , 2004, TOMS.

[3]  Pierre L'Ecuyer,et al.  An Object-Oriented Random-Number Package with Many Long Streams and Substreams , 2002, Oper. Res..

[4]  Lih-Yuan Deng,et al.  Scalable parallel multiple recursive generators of large order , 2009, Parallel Comput..

[5]  Lih-Yuan Deng,et al.  A system of high-dimensional, efficient, long-cycle and portable uniform random number generators , 2003, TOMC.

[6]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[7]  Pierre L'Ecuyer,et al.  A search for good multiple recursive random number generators , 1993, TOMC.

[8]  Lih-Yuan Deng,et al.  Generalized Mersenne Prime Number and Its Application to Random Number Generation , 2004 .

[9]  Lih-Yuan Deng,et al.  Design and Implementation of Efficient and Portable Multiple Recursive Generators with Few Zero Coefficients , 2008 .

[10]  R. Caflisch.  Monte Carlo and quasi-Monte Carlo methods , 1998, Acta Numerica.

[11]  Michael Mascagni,et al.  Testing parallel random number generators , 2003, Parallel Comput..

[12]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[13]  Pierre L'Ecuyer,et al.  Combined Multiple Recursive Random Number Generators , 1995, Oper. Res..

[14]  Michael C. Fu,et al.  Guest editorial , 2003, TOMC.

[15]  Harald Niederreiter,et al.  Finite fields and their applications , 1996 .

[16]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[17]  Lih-Yuan Deng,et al.  Issues on Computer Search for Large Order Multiple Recursive Generators , 2008 .

[18]  Pierre L'Ecuyer,et al.  Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators , 1999, Oper. Res..

[19]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .