Home → Magazine Archive → December 1969 (Vol. 12, No. 12) → A fast random number generator for IBM 360 → Abstract

A fast random number generator for IBM 360

By Dominic S. Seraphin

Communications of the ACM, Vol. 12 No. 12, Page 695

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.

The full text of this article is premium content


No entries found