Abstract
A CACM by Park and Miller [6] advocated a standard for random number generators based on the Lehmer generator [5] and criticised a number of computer science textbooks for presenting bad random number generators. This paper advocates the proposed standard and presents a set of generators based on theoretically sound principles that are also useful for microcomputer implementation and classroom presentations at the introductory level.
- 1 Abrahams, P.W., Technical Correspondence. Commun. A CM 32, 8 (Aug. 1989), 1021-1022. Google Scholar
Digital Library
- 2 Edgeman, R.L., Technical Correspondence. Commun. ACM 32, 8 (Aug. 1989), 1020- 1021. Google Scholar
Digital Library
- 3 Knuth, D.E. The Art of Computer Programming. Vol. 2 Seminumerical Algorithms. 2nd Ed. Addison-Wesley, Reading, Mass., 1981. Google Scholar
Digital Library
- 4 L'Ecuyer, P. Efficient and portable combined random number generators. Commun. ACM 31, 6 (June 1988), 742-74Q, 774. Google Scholar
Digital Library
- 5 Lehmer, D.H. Mathematical methods in large-scale computing units. Annu. Comput. Lab. Harvard Univ. 26 (1951), 1.41-146.Google Scholar
- 6 Park, S.K., and Miller, K.W. Random number generators: Good ones are hard to find. Commun. ACM 31, 10 (Oct. 1988), 1192-1201. Google Scholar
Digital Library
- 7 Park, S.K., and Miller, Technical Correspondence. Commun. A CM 32, 8 (Aug. 1989), 1023-1024.Google Scholar
- 8 Sand, F.M., Technical Correspondence. Commun. ACM 32, 8 (Aug. 1989), 1022- 1023. Google Scholar
Digital Library
- 9 Warford, J. S. Computer Science. D.C. Heath and Company, Lexington, Mass., 1991. Google Scholar
Digital Library
Index Terms
Good pedagogical 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 ...
Good pedagogical random number generators
SIGCSE '92: Proceedings of the twenty-third SIGCSE technical symposium on Computer science educationA CACM by Park and Miller [6] advocated a standard for random number generators based on the Lehmer generator [5] and criticised a number of computer science textbooks for presenting bad random number generators. This paper advocates the proposed ...
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-...






Comments