Abstract
In this paper we present an efficient way to combine two or more Multiplicative Linear Congruential Generators (MLCGs) and propose several new generators. The individual MLCGs, making up the proposed combined generators, satisfy stringent theoretical criteria for the quality of the sequence they produce (based on the Spectral Test) and are easy to implement in a portable way. The proposed simple combination method is new and produces a generator whose period is the least common multiple of the individual periods. Each proposed generator has been submitted to a comprehensive battery of statistical tests. We also describe portable implementations, using 16-bit or 32-bit integer arithmetic. The proposed generators have most of the beneficial properties of MLCGs. For example, each generator can be split into many independent generators and it is easy to skip a long subsequence of numbers without doing the work of generating them all.
- 1 Borosh, S., and Niederreiter, H. Optimal multipliers for pseudorandom number generation by the linear congruential method. BIT 23 (1983), 65-74.Google Scholar
Cross Ref
- 2 Bratley, P., Fox, B.L., and Schrage, L.E. A Guide to Simulation. Springer-Verlag, New York, N.Y., 2nd ed., 1987. Google Scholar
Digital Library
- 3 Clark., R.N. A Pseudorandom Number Generator. Simulation 45, 5 (Nov. 1985), 252-255.Google Scholar
Cross Ref
- 4 Coveyou, R.R., and MacPherson, R.D. Fourier analysis of uniform random number generators. J. ACM 14 (Jan. 1967), 100-119. Google Scholar
Digital Library
- 5 Dieter, U. How to calculate shortest vectors in a lattice. Math. Cornput. 29 (July 1975), 827-833.Google Scholar
Cross Ref
- 6 Dudewicz, E.J., Karian, Z.A., and Marshall, R.}., III. Random number generation on microcomputers. Modeling and Simulation on Microcomputers: 1985, The Society for Computer Simulation, 1985, pp. 9-14.Google Scholar
- 7 Figie}, K.D., and Sule, D.R. New lagged product test for random number generators. Comput. Ind. Eng. 9, 3 (Mar. 1985), 287-296.Google Scholar
- 8 Fishman, G.S., and Moore, L.S., Ill. A statistical evaluation of multiplicative congruential random number generators with modulus 23'-1. J. Am. Star. Assoc. 77 (Mar. 1982), 129-136.Google Scholar
Cross Ref
- 9 Fishman, G.S., and Moore, L.S., III. An exhaustive anai{ysis of multiplicative congruential random number generators with modulus 23~ - 1. SIAM J. Sci. Stat. Comput. 7, 1 (Jan. 1986), 24-45. Google Scholar
Digital Library
- 10 Fushimi, M., and Tezuka, S. The k-distribution of generalized feedback shift register pseudorandom numbers. Commun. ACM 26, 7 (July 1983), 516-523. Google Scholar
Digital Library
- 11 Knuth, D.E. The Art of Computer Programming--Seminumerical Algorithms, vol. 2, 2nd ed., Addison-Wesley, Reading, Mass. 1981. Google Scholar
Digital Library
- 12 Lewis, P.A.W., Goodman, A.S., and Miller, ).M. A pseudo-random number generator for the system/360. IBM Syst. J. 8, 2 (1969), 136- 146.Google Scholar
Digital Library
- 13 Marsaglia, G. Random numbers fall mainly in the planes. Proc. Nat. Acad. Sci. 61 (Sept. 1968), 25-28.Google Scholar
Cross Ref
- 14 Marse, K. and Roberts, S.D. Implementing a portable FORTRAN uniform {0, 1) generator. Simulation 41, 4 {Oct. 1983}, 135-139.Google Scholar
Cross Ref
- 15 Modianos, D.T., Scott, R.C., and Cornwell, L.W. Random number generation on microcomputers. Interfaces 14, 2 (Mar.-April 1984), 81-87.Google Scholar
Digital Library
- 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.Google Scholar
- 17 Niederreiter, H. Quasi-Monte Carlo methods and pseudo-random numbers. Bull. Amer. Math. Soc. 84, 6 (Nov. 1978), 957-1041.Google Scholar
Cross Ref
- 18 Payne, W.H., Rabung, J.R., and Bogyo, T.P. Coding the Lehmer pseudo-random number generator. Commun. ACM 12, ,; (Feb. 1969), 85-86. Google Scholar
Digital Library
- 19 Schrage, L. A more portable Fortran random number generator. ACM Trans. Math. Soft. 5, 2 (June 1979), 132-138. Google Scholar
Digital Library
- 20 Thesen, A. An efficient generator of uniformly distributed random variates between zero and one. Simulation 44, 1 I tan. 1985), 17-22.Google Scholar
Cross Ref
- 21 Wichmann, B.A and Hill, I.D. An efficient and portable pseudorandom number generator. Appl. Stat. 31 (1982), 188-190.Google Scholar
Cross Ref
Index Terms
Efficient and portable combined random number generators
Recommendations
Bit-Wise Behavior of Random Number Generators
In 1985, G. Marsaglia proposed the m-tuple test, a runs test on bits, as a test of nonrandomness of a sequence of pseudorandom integers. We try this test on the outputs from a large set of pseudorandom number generators and discuss the behavior of the ...
Resolution-stationary random number generators
Besides speed and period length, the quality of uniform random number generators (RNGs) is usually assessed by measuring the uniformity of their point sets, formed by taking vectors of successive output values over their entire period length. For F"2-...
Extremely portable random number generator
Extremely portable subroutines are sometimes needed for which moderate quality and efficiency suffice. Typically, this occurs for library functions (like random number generation and incore sorting) which are not entirely universal or are not used in a ...






Comments