Pseudorandom number generators for supercomputers and classical computers: A practical introduction

When the cycle of a multiplicative congruential generator with a modulus that is a power of two is split into two parts, then the pseudorandom numbers across parts turn out to lie on only two parallel lines. These ‘long range’ correlations have consequences for computers with a traditional or a new architecture. For vector computers, simple alternative computer implementations are presented. These implementations are faster than the standard subroutines available on a specific vector computer, namely the CYBER 205.