A class of parallel random number generators (Q916299): Difference between revisions

The authors discuss pseudorandom number generation in a parallel environment and it may be concluded that the classical multiplicative and mixed multiplicative algorithms modulo a power of 2 do not hold out much promise of lengthy uncorrelated sequences. In the authors' own words: ``The existence of correlations of various kinds brought out within a class of generators shows that parallelisation of Monte Carlo computations is far from being an easy task and requires the greatest care.''