Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

This paper presents some Multiplicative Linear Congruential Generators (MLCGs) and one generator that combine two MLCGs. The individual MLCGs use short multipliers that are nearly optimal based on the spectral test. The shortness of the multipliers leads to fast and portable implementations. The combination method produces a generator whose period is the least common multiple of the individual periods. These generators can also be split into many "independent" generators (i.e. that produce disjoint subsequences) and it is easy to skip a long subsequence of numbers without doing the work of generating them all.

REFERENCES

• 1: Paul Bratley , Bennett L Fox , Linus E Schrage, A guide to simulation (2nd ed.), Springer-Verlag New York, Inc., New York, NY, 1986
• 2: George A Fishman , Louis R Moore, III, An exhaustive analysis of multiplicative congruential random number generators with modulus 2³¹-1, SIAM Journal on Scientific and Statistical Computing, v.7 n.1, p.24-45, Jan. 1986 [doi>10.1137/0907002]
• 3: Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
• 4: L'Ecuyer, P. (1986). Efficient and portable combined pseudo-random number generators. Research report no. DIUL-RR-8612, Département d'informatique, Université Laval, Ste-Foy, Québec, Canada.
• 5: Marsaglia, G. (1968). Random Numbers Fall Mainly in the Planes. Proceedings of the National Academy of Sciences of the United States of America 60, 25--28.
• 6: Marse, K. and Roberts, S. D. (1983). Implementing a Portable FORTRAN Uniform (0,1) Generator. Simulation 41, 4, 135--139.
• 7: Modianos, D. T., Scott R. C. and Cornwell, L. W. (1984). Random Number Generation on Microcomputers. Interfaces 14, 2, 81--87.
• 8: Nance, R. E. and Overstreet Jr., C. (1978). Some Experimental Observations on the Behavior of Composite Random Number Generators. Operations Research 26, 5, 915--935.
• 9: Niederreiter, H. (1978). Quasi-Monte Carlo Methods and Pseudo-random Numbers. Bulletin of the American Mathematical Society 84, 6, 957--1041.
• 10: Linus Schrage, A More Portable Fortran Random Number Generator, ACM Transactions on Mathematical Software (TOMS), v.5 n.2, p.132-138, June 1979 [doi>10.1145/355826.355828]
• 11: Wichmann, B. A. and Hill, I. D. (1982). An Efficient and Portable Pseudo-random Number Generator. Applied Statistics 31, 188--190.