S. K. Park
Skip Abstract Section
Abstract
Practical and theoretical issues are presented concerning the design, implementation, and use of a good, minimal standard random number generator that will port to virtually all systems.
- 1 Bratley, P., Fox, B.L., and Schrage, E.L. A Guide to Simulation. Springer-Verlag, New York, 1983, pp. 180-213. Google Scholar
Digital Library
- 2 Bulgren, W.G. Discrete System Simulation. Prentice-Hall, Englewood Cliffs, N.J., 1982, p. 155. Google ScholarDigital Library
- 3 Clocksin. W.F., and Mellish, C.S. Programming in Prolog. Springer- Verlag, New York, 1987, p. 153. Google ScholarDigital Library
- 4 Coveyou, R.R., and MacPherson, R.D. Fourier analysis of uniform random number generators. J. ACM 14 (Jan. 1967}, 100-119. Google ScholarDigital Library
- 5 Collins, W.J. Intermediate Pascal Programming: A Case Study Approach. McGraw-Hill, New York, 1986, p. 157. Google ScholarDigital Library
- 6 Cooper, D., and Clancy, M. Oh! Pascal!. 2nd Ed. W. W. Norton, New York, 1985, p. 145. Google ScholarDigital Library
- 7 Fishman, G.S. Principles of Discrete Event Simulation. Wiley-Interscience, New York, 1978, pp. 345-391. Google ScholarDigital Library
- 8 Fishman, G.S., and Moore, L.R. A statistical evaluation of multiplicative congruential random number generators with modulus 23~ - 1. J. Am. Stat. Assoc. 77, 377 {Mar. 1982), 129-136.Google Scholar
- 9 Fishman. G.S., and Moore, L.R. An exhaustive analy~ds of multiplicative congruential random number generators with modulus 22~ - 1. SIAM J. Sci. Stat. Comput. 7, 1 (1986), 24-45. Google ScholarDigital Library
- 10 Gabriel, R. Performance and Evaluation of LISP Systems. M.I.T. Press, Cambridge, Mass., 1985, p. 140. Google ScholarDigital Library
- 11 Gilbert, J.R. The University of Sheffield Pascal System for Prime Computers. University of Sheffield, Sheffield, England, 1987, p. 10.Google Scholar
- 12 Gottfried, B.S. Schaum's Outline of Theory and Problems of Programming with Pascal. McGraw-Hill, New York, 1985, p. 143. Google ScholarDigital Library
- 13 Grogono, P. Programming in Pascal. 2nd Ed. Addison-Wesley, Reading, Mass., 1984, pp. 135-137. Google ScholarDigital Library
- 14 Hoaglin, D.C. Theoretical properties of congruential randomnumber generators: An empirical view. Memo NS-340. Dept. of Statistics, Harvard University, Cambridge, Mass., 1976.Google Scholar
- 15 Hull, T.T., and Dobell, A.R. Random number generators. SIAM Rev. 4 (July 1962), 230-254.Google ScholarDigital Library
- 16 Hutchinson, D.W. A new uniform pseudorandom number generator. Commun. ACM 9, 6 (June 1966), 432-433. Google ScholarDigital Library
- 17 IMSL Stat/Library User's Manual. IMSL, Houston, Tex., 1987, pp. 947-951.Google Scholar
- 18 Knuth, D.E. The Art of Computer Programming. 2nd Ed. Addison- Wesley, Reading, Mass., 1981. Google ScholarDigital Library
- 19 Konvalina. }., and Wileman, S. Programming with Pascal. McGraw- Hill, New York, 1987, p. 288. Google ScholarDigital Library
- 20 Lamb, R. Pascal Structure and Style. Benjamin/Cummings, Menlo Park, Calif., 1986, pp. 226-227. Google ScholarDigital Library
- 21 Lamie, E.L. Pascal Programming. John Wiley and Sons, New York, 1987, p. 150. Google ScholarDigital Library
- 22 Law, A.M., and Kelton, W.D. Simulation Modeling and Analysis. McGraw-Hill, New York, 1982, pp. 219-239. Google ScholarDigital Library
- 23 Lavenberg, S.S., Ed. Computer Performance Modeling Handbook. Academic Press, New York, 1983, pp. 223-229. Google ScholarDigital Library
- 24 L'Ecuyer, P. Efficient and portable combined random number generators. Commun. ACM 31, 6 (June 1988), 742-749, 774. Google ScholarDigital Library
- 25 Leestma, S., and Nyhoff, L. Pascal Programming and Problem Solving. Macmillan, New York, 1984, pp. 172-173. Google ScholarDigital Library
- 26 Lehmer, D.H. Mathematical methods in large-scale computing units. Annu. Comput. Lab. Harvard Univ. 26 (1951), 141-146.Google Scholar
- 27 Lewis, P.A., Goodman, A.S., and Miller, J.M. A pseudo-random number generator for the System/360. IBM Syst. J. 8, 2 (1969), 136-146.Google ScholarDigital Library
- 28 Maclaren, M.D., and Marsaglia, G. Uniform random number genera- Google ScholarDigital Library
- 29 MacModuta-2 System Reference Manual. Modula Corporation, 1985, p. 41.Google Scholar
- 30 Marsaglia, G. Random numbers fall mainly in the planes. Natl. Acad. Sci. Prec. 61 (Sept. 1968), 25-28.Google ScholarCross Ref
- 31 Marsaglia, G., and Bray, T.A. One-line random number generators and their use in combinations. Commun. ACM 11, 11 (Nov. 1968), 757-759. Google ScholarDigital Library
- 32 Maryanski, F. Digital Computer Simulation. Hayden, Rochelle Park, N.J., 1980, pp. 224-230.Google Scholar
- 33 Moffat, D.V. Common Algorithms in Pascal. Prentice-Hall, Englewood Cliffs, N.J., 1984, pp. 201-203.Google Scholar
- 34 Motluzzo, J.C., and Buckely, F. Discrete Mathematics. Wadsworth, Belmont, Calif., 1986, pp. 219-221.Google Scholar
- 35 Nyhoff, L., and Leestma, S. FORTRAN 77 for Engineers and Scientists. Macmillan, New York, 1985, pp. 292-294. Google ScholarDigital Library
- 36 Payne, J.A. Introduction to Simulation: Programming Techniques and Methods of Analysis. McGraw,Hill, New York, 1982, pp. 105-106. Google ScholarDigital Library
- 37 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. Google ScholarDigital Library
- 38 SAS User's Guide: Basics, Version 5 Edition. SAS Institute Inc., Cary, N.C., 1985, pp. 278-280.Google Scholar
- 39 Sauer, C.H., and Chandy, K.M. Computer Systems Performance Modeling. Prentice-Hall, Englewood Cliffs, N.J., 1981, pp. 195-199.Google Scholar
- 40 Savitch, W.J. Pascal, An Introduction to the Art and Science of Programming. Benjamin/Cummings, Menlo Park, Calif., 1984, p. 244. Google ScholarDigital Library
- 41 vSchrage, L. A more portable FORTRAN random number generator. ACM Trans. Math. Softw. 5, 2 (June 1979), 132-138. Google ScholarDigital Library
- 42 SLAM I1 Installation and Operations Guide, Version 3.2. Pritsker and Associates, West Lafayette, Ind., 1986, pp. 3.4-3.9.Google Scholar
- 43 Smith, M. FORTRAN 77, A Problem-Solving Approach. Houghton Mifflin, Boston, Mass., 1985, pp. 330-331. Google ScholarDigital Library
- 44 Subroutines Reference Guide. 3rd Ed. Prime Computer, Natick, Mass., 1984, p. 12.45.Google Scholar
- 45 System/360 Scientific Subroutine Package, Version IlL Programmer's Manual. IBM, White Plains, New York, 1968, p. 77.Google Scholar
- 46 Turbo Pascal, Version 3.0. Borland International, Scotts Valley, Calif., 1986.Google Scholar
- 47 Wichmann, B.A., and Hill, I.D. An efficient and portable pseudorandom number generator. Appl. Stat, 31 (1982), 188-190.Google ScholarCross Ref
Index Terms
- Random number generators: good ones are hard to find
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-...
A search for good pseudo-random number generators: Survey and empirical studies
AbstractThis paper targets to search so-called good generators by doing a brief survey over the generators developed in the history of pseudo-random number generators (PRNGs), verify their claims and rank them based on strong empirical tests ...
Comments