skip to main content
article
Free Access

A comparison of four pseudo random number generators implemented in Ada

Published:15 September 1992Publication History
Skip Abstract Section

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.

References

  1. Ada (1983). "Reference Manual for the Ada Programming Language," ANSI/MIL-STD-1815A-1983, United States Department of Defense.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle Scholar
  3. Fishman, G. S. (1978). "Principles of Discrete Event Simulation," John Wiley & Sons, New York, 345--391.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. Knuth, D. E. (1981). "The Art of Computer Programming: Seminumerical Algorithms," vol 2, 2nd ed., Addison-Wesley, Reading, Mass., 1--177.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Law, A. M. and W. D. Kelton (1982). "Simulation Modeling and Analysis," McGraw-Hill, New York.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. L'Ecuyer, P. (1988). "Efficient and Portable Combined Random Number Generators," Communications of the ACM, 31(6), 742--774, June.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Molloy, M. K. (1989). "Fundamentals of Performance Modeling," Macmillan, New York, 84-95.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Sedgewick, R. (1983). "Algorithms," Addison Wesley, Reading, Mass. 33--42.]]Google ScholarGoogle Scholar
  10. Wichmann, B. A. and I. D. Hill (1982). "A Pseudo-Random Number Generator," National Physical Laboratory Report, DITC, June.]]Google ScholarGoogle Scholar
  11. Wichmann, B. A. and I. D. Hill (1987). "Building a Random Number Generator," Byte, March, 127--128.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A comparison of four pseudo random number generators implemented in Ada

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGSIM Simulation Digest
        ACM SIGSIM Simulation Digest  Volume 22, Issue 2
        Fall 1992
        49 pages
        ISSN:0163-6103
        DOI:10.1145/142103
        Issue’s Table of Contents

        Copyright © 1992 Author

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 15 September 1992

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!