Sciweavers

PC
1998

Parallel Linear Congruential Generators with Prime Moduli

13 years 10 months ago
Parallel Linear Congruential Generators with Prime Moduli
Linear congruential generators (LCGs) remain the most popular method of pseudorandom number generation on digital computers. Ease of implementation has favored implementing LCGs with power-of-two moduli. However, prime modulus LCGs are superior in quality to power-of-two modulus LCGs, and the use of a Mersenne prime minimizes the computational cost of generation. When implemented for parallel computation, quality becomes an even more compelling issue. We use a full-period exponential sum as the measure of stream independence and present a method for producing provably independent streams of LCGs in parallel by utilizing an explicit parameterization of all of the primitive elements modulo a given prime. The minimization of this measure of independence further motivates an algorithm required in the explicit parameterization. We describe and analyze this algorithm and describe its use in a parallel LCG package.
Michael Mascagni
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 1998
Where PC
Authors Michael Mascagni
Comments (0)