Back to Search Start Over

Extremely portable random number generator

Authors :
J. B. Kruskal
Source :
Communications of the ACM. 12:93-94
Publication Year :
1969
Publisher :
Association for Computing Machinery (ACM), 1969.

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.

Details

ISSN :
15577317 and 00010782
Volume :
12
Database :
OpenAIRE
Journal :
Communications of the ACM
Accession number :
edsair.doi...........b16c655badd2d9f5caefb2312f13992e
Full Text :
https://doi.org/10.1145/362848.362865