Scalable parallel multiple recursive generators of large order

To speed up the process of performing a large statistical simulation study, it is natural and common to divide the large-scale simulation task into several relatively independent sub-tasks in a way that these sub-tasks can be handled by individual processors in parallel. To obtain a good overall simulation result by synthesizing results from these sub-tasks, it is crucial that good parallel random number generators are used. Thus, designing suitable and independent uniform random number generators for the sub-tasks has become a very important issue in large-scale parallel simulations. Two commonly used uniform random number generators, linear congruential generator (LCG) and multiple recursive generator (MRG), have served as backbone generators for some parallel random number generators constructed in the past. We will discuss some general construction methods. A systematic leapfrog method to automatically choose different multipliers for LCGs to have the maximum-period and a method to construct many maximum-period MRGs from a single MRG are available in the literature. In this paper, we propose to combine both approaches to generate different MRGs ''randomly'', quickly and automatically, while retaining the maximum-period property.

[1]  Michael Mascagni.  Parallel Linear Congruential Generators with Prime Moduli , 1998, Parallel Comput..

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

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

[4]  Michael Mascagni.  SPRNG: A Scalable Library for Pseudorandom Number Generation , 1999, PPSC.

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

[6]  Harald Niederreiter,et al.  Monte Carlo and Quasi-Monte Carlo Methods 2002 , 2004 .

[7]  N. Zierler.  Linear Recurring Sequences , 1959 .

[8]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[9]  Dennis K. J. Lin,et al.  Random Number Generation for the New Century , 2000 .

[10]  Burton J. Smith,et al.  Pseudo-random trees in Monte Carlo , 1984, Parallel Comput..

[11]  I. Niven,et al.  An introduction to the theory of numbers , 1961 .

[12]  A. Grube,et al.  Mehrfach rekursiv‐erzeugte Pseudo‐Zufallszahlen , 1973 .

[13]  Lih-Yuan Deng,et al.  Efficient and portable multiple recursive generators of large order , 2005, TOMC.

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

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

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

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

[18]  F. Blouin,et al.  Linear congruential generators of order K>1 , 1988, 1988 Winter Simulation Conference Proceedings.

[19]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Lih-Yuan Deng,et al.  Random number generators for multiprocessor systems , 1994 .

[21]  Haya Freedman,et al.  Introduction to finite fields and their applications (revised edition) , by Rudolf Lidl and Harald Niederreiter. Pp. 416. £29.95. 1994. ISBN 0-521-46094-8 (Cambridge University Press) , 1995, The Mathematical Gazette.

[22]  Harald Niederreiter,et al.  Monte Carlo and Quasi-Monte Carlo Methods 2006 , 2007 .

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

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

[25]  Michael Mascagni,et al.  SPRNG: A Scalable Library for Pseudorandom Number Generation , 1999, PP.