High Performance Computing 1

Leapfrog

•In this approach, the sequence of a serial generator is partitioned in turn among multiple processors like a deck of cards dealt to card players. If there are N processors, each processor leapfrogs by N in the sequence. For example, processor i gets Xi , Xi+N , Xi+2N , etc. This again has the problem that long-range correlations in the original sequence can become short-range inter-stream correlations in the parallel generator.