ACM

Communications of the ACM

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, December 1969, Vol. 12 No. 12, Page 695
10.1145/363626.363663
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.