Efficient and portable combined random number generators

Communications of the ACM

Volumn 31, Issue 6, 1988, Pages 742-751

  L'Ecuyer, Pierre ^a  

^a UNIVERSITÉ LAVAL   (Canada)

Author keywords

Combined generators; empirical tests; multiplicative linear congruential generators; portability; spectral test

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

COMBINED RANDOM NUMBER GENERATORS; INTEGER ARITHMETIC; MULTIPLICATIVE LINEAR CONGRUENTIAL GENERATORS; PORTABLE RANDOM NUMBER GENERATORS;

MATHEMATICAL STATISTICS;

EID: 0024029607     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/62959.62969     Document Type: Article

References (21)

1. Borosh, S., and Niederreiter, H. Optimal multipliers for pseudorandom number generation by the linear congruential method. BIT 23 (1983), 65–74.
2. Bratley, P., Fox, B.L., and Schrage, L.E. A Guide to Simulation. Springer-Verlag, New York, N.Y., 2nd ed., 1987.
3. Clark, R.N. A Pseudorandom Number Generator. Simulation 45, 5 (Nov. 1985), 252–255.
4. Coveyou, R.R., and MacPherson, R.D. Fourier analysis of uniform random number generators. J. ACM 14 (Jan. 1967), 100–119.
5. Dieter, U. How to calculate shortest vectors in a lattice. Math. Corn-put. 29 (July 1975), 827–833.
6. Dudewicz, E.J., Karian, Z.A., and Marshall, R.J., III. Random number generation on microcomputers. Modeling and Simulation on Micro-computers: 1985, The Society for Computer Simulation, 1985, pp. 9–14.
7. Figiel, K.D., and Sule, D.R. New lagged product test for random number generators. Comput. Ind. Eng. 9, 3 (Mar. 1985), 287–296.
8. Fishman, G.S., and Moore, L.S., III. A statistical evaluation of multiplicative congruential random number generators with modulus 231-1. J. Am. Stat. Assoc. 77 (Mar. 1982), 129–136.
9. Fishman, G.S., and Moore, L.S., III. An exhaustive analysis of multiplicative congruential random number generators with modulus 231 - 1. SIAM J. Sci. Stat. Comput. 7, 1 (Jan. 1986), 24–45.
10. Fushimi, M., and Tezuka, S. The k-distribution of generalized feedback shift register pseudorandom numbers. Commun. ACM 26, 7 (July 1983), 516–523.
11. Knuth, D.E. The Art of Computer Programming—Seminumerical Algorithms. vol. 2, 2nd ed., Addison-Wesley, Reading, Mass. 1981.
12. Lewis, P.A.W., Goodman, A.S., and Miller, J.M. A pseudo-random number generator for the system/360. IBM Syst. J. 8, 2 (1969), 136– 146.
13. Marsaglia, G. Random numbers fall mainly in the planes. Proc. Nat. Acad. Sci. 61 (Sept. 1968), 25–28.
14. Marse, K. and Roberts, S.D. Implementing a portable FORTRAN uniform (0, 1) generator. Simulation 41, 4 (Oct. 1983), 135–139.
15. Modianos, D.T., Scott, R.C., and Cornwall, L.W. Random number generation on microcomputers. Interfaces 14, 2 (Mar.-April 1984), 81–87.
16. Nance, R.E., and Overstreet, C., Jr. Some experimental observations on the behavior of composite random number generators. Oper. Res. 26, 5 (Sept.–Oct. 1978), 915–935.
17. Niederreiter, H. Quasi-Monte Carlo methods and pseudo-random numbers. Bull. Amer. Math. Soc. 84, 6 (Nov. 1978), 957–1041.
18. Payne, W.H., Rabung, J.R., and Bogyo, T.P. Coding the Lehmer pseudo-random number generator. Commun. ACM 12, 2 (Feb. 1969), 85–86.
19. Schrage, L. A more portable Fortran random number generator. ACM Trans. Math. Soft. 5, 2 (June 1979), 132–138.
20. Thesen, A. An efficient generator of uniformly distributed random variates between zero and one. Simulation 44, 1 (Jan. 1985), 17–22.
21. Wichmann, B.A. and Hill, I.D. An efficient and portable pseudorandom number generator. Appl. Stat. 31 (1982), 188–190.