Abstract
Four random number generators implemented in Ada are compared in terms of their equidistribution, independence, speed and period. Each generator is described and it's code presented. The tests used to evaluate the generators were simple ones. First, a stream of random numbers generated were checked for equidistribution by means of a chi-square test. Next, the numbers were checked for independence by means of a serial test. The code was then timed for a certain number of iterations. Finally, the reported periods of the generators are compared.
- Ada (1983). "Reference Manual for the Ada Programming Language," ANSI/MIL-STD-1815A-1983, United States Department of Defense.]] Google Scholar
Digital Library
- Angel, M., P. Juozitis and J. Sabuda (1989). "TASKIT: An Ada Alternative for Activity Oriented Simulations," Proceedings of the 1989 Summer Computer Simulation Conference (Austin, Texas, July 24-27), The Society for Computer Simulation, 631--635.]]Google Scholar
- Fishman, G. S. (1978). "Principles of Discrete Event Simulation," John Wiley & Sons, New York, 345--391.]] Google Scholar
Digital Library
- Harmon, M. G. and T. P. Baker (1988). "An Ada Implementation of Marsaglia's UNIVERSAL Random Number Generator," ACM SIGAda, Ada Letters,
VIII(2) , 110-112, March/April.]] Google ScholarDigital Library
- Knuth, D. E. (1981). "The Art of Computer Programming: Seminumerical Algorithms," vol 2, 2nd ed., Addison-Wesley, Reading, Mass., 1--177.]] Google Scholar
Digital Library
- Law, A. M. and W. D. Kelton (1982). "Simulation Modeling and Analysis," McGraw-Hill, New York.]] Google Scholar
Digital Library
- L'Ecuyer, P. (1988). "Efficient and Portable Combined Random Number Generators," Communications of the ACM,
31(6) , 742--774, June.]] Google ScholarDigital Library
- Molloy, M. K. (1989). "Fundamentals of Performance Modeling," Macmillan, New York, 84-95.]] Google Scholar
Digital Library
- Sedgewick, R. (1983). "Algorithms," Addison Wesley, Reading, Mass. 33--42.]]Google Scholar
- Wichmann, B. A. and I. D. Hill (1982). "A Pseudo-Random Number Generator," National Physical Laboratory Report, DITC, June.]]Google Scholar
- Wichmann, B. A. and I. D. Hill (1987). "Building a Random Number Generator," Byte, March, 127--128.]] Google Scholar
Digital Library
Index Terms
A comparison of four pseudo random number generators implemented in Ada
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 ...
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 ...
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