|
 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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Borosh, S., and Niederreiter, H. Optimal multipliers for pseudorandom number generation by the linear congruential method. BIT 23 (1983), 65-74.
|
| |
2
|
|
| |
3
|
Clark., R.N. A Pseudorandom Number Generator. Simulation 45, 5 (Nov. 1985), 252-255.
|
 |
4
|
|
| |
5
|
Dieter, U. How to calculate shortest vectors in a lattice. Math. Cornput. 29 (July 1975), 827-833.
|
| |
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.
|
| |
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.
|
| |
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.
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
| |
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.
|
| |
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 Cornwell, 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
|
|
| |
19
|
|
| |
20
|
Thesen, A. An efficient generator of uniformly distributed random variates between zero and one. Simulation 44, 1 I tan. 1985), 17-22.
|
| |
21
|
Wichmann, B.A and Hill, I.D. An efficient and portable pseudorandom number generator. Appl. Stat. 31 (1982), 188-190.
|
CITED BY 45
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lih-Yuan Deng , E. Olusegun George , Yu-Chao Chu, On improving pseudo-random number generators, Proceedings of the 23rd conference on Winter simulation, p.1035-1042, December 08-11, 1991, Phoenix, Arizona, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ares Lagae , Craig S. Kaplan , Chi-Wing Fu , Victor Ostromoukhov , Oliver Deussen, Tile-based methods for interactive applications, ACM SIGGRAPH 2008 classes, August 11-15, 2008, Los Angeles, California
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.3