Extremely portable random number generator

Authors:
J. B. Kruskal
Affiliations:
Bell Telephone Labs, Inc., Murray Hill, NJ
Venue:
Communications of the ACM
Year:
1969

Citing 1
Cited 5

Fourier Analysis of Uniform Random Number Generators

Journal of the ACM (JACM)

A fast and portable uniform quasi-random generator of very large period based ona generalized multi-moduli congruential method

ACM SIGSIM Simulation Digest
A fast uniform astronomical random number generator

ACM SIGSAC Review
A More Portable Fortran Random Number Generator

ACM Transactions on Mathematical Software (TOMS)
Fortran Tausworthe pseudorandom number generator

Communications of the ACM
Merrily we roll along: Some aspects of?

APL '83 Proceedings of the international conference on APL

Quantified Score

Hi-index	48.23

Visualization

Abstract

Extremely portable subroutines are sometimes needed for which moderate quality and efficiency suffice. Typically, this occurs for library functions (like random number generation and incore sorting) which are not entirely universal or are not used in a standardized way.The literature on random number generators does not seem to contain an algorithm that meets requirements of this sort. An extremely portable 8-line FORTRAN program is provided which is based on an important paper by Coveyou and MacPherson (1967). Using their methods, Fourier analysis is applied to the probability function for the consecutive n-tuples provided by our generator (with n less than or equal to 4). While the small modulus which must be used to maintain portability prevents the quality of the generator from being high, the generator compares well with the bounds established in the above mentioned paper.