A fast random number generator for IBM 360

Authors:
Dominic S. Seraphin
Affiliations:
State Univ. of New York at Stony Brook
Venue:
Communications of the ACM
Year:
1969

Citing 1
Cited 2

One-line random number generators and their use in combinations

Communications of the ACM

Algorithm 425: generation of random correlated normal variables [G5]

Communications of the ACM
Remark on algorithm 381 [G5]

Communications of the ACM

Quantified Score

Hi-index	48.25

Visualization

Abstract

Marsaglia and Bray [1] recommend incorporating two-line random number generators directly into FORTRAN programs. One of the advantages of this is the time saved in avoiding linkage to and fro from a subroutine. Implicit in their FORTRAN routine for IBM 360 for Lehmer's multiplicative congruence method, namely; Uk+1 = &lgr;Uk (mod P), Xk+1 = Uk+1/P is the use of 232 as the value of modulus P.