Critical distances in pseudorandom sequences generated with composite moduli
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 43 (3-4) , 189-196
- https://doi.org/10.1080/00207169208804085
Abstract
In periodic sequences of pseudorandom numbers generated by multiplicative congruential schemes, terms at certain critical distances are strongly correlated. For powers of two moduli a fast arithmetic method for computing these distances is given and applied to several generators. For all of them the length of the sequence that can be safely used turns out to be much shorter than the period. These correlations should be taken into account in parallel computations when a single pseudorandom sequence is partitioned among concurrent processors.Keywords
This publication has 8 references indexed in Scilit:
- Long-range correlations in linear and non-linear random number generatorsParallel Computing, 1990
- A remark on long-range correlations in multiplicative congruential pseudo random number generatorsNumerische Mathematik, 1989
- Parallelization of random number generators and long-range correlationsNumerische Mathematik, 1988
- Optimal multipliers for pseudo-random number generation by the linear congruential methodBIT Numerical Mathematics, 1983
- The Structure of Linear Congruential SequencesPublished by Elsevier ,1972
- The lattice structure of multiplicative congruential pseudo-random vectorsMathematics of Computation, 1971
- Pseudo-random numbersComputing, 1970
- An a priori determination of serial correlation in computer generated random numbersMathematics of Computation, 1961