Parallel linear congruential generators with prime moduli

Parallel Computing

Volumn 24, Issue 5-6, 1998, Pages 923-936

  Mascagni, Michael ^a  

^a The University of Southern Mississippi   (United States)

Author keywords

Linear congruential generators; Parallel computing; Pseudorandom number generation

Indexed keywords

PARALLEL ALGORITHMS; RANDOM NUMBER GENERATION;

LINEAR CONGRUENTIAL GENERATORS (LCG);

PARALLEL PROCESSING SYSTEMS;

EID: 0032097787     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00010-6     Document Type: Article

References (20)

1. D.H. Lehmer, Mathematical methods in large-scale computing units, Proc. 2nd Symposium on LargeScale Digital Calculating Machinery, Harvard Univ. Press, Cambridge, MA, 1949, pp. 141-146.
2. P. Frederickson, R. Hiromoto, T.L. Jordan, B. Smith, T. Warnock, Pseudo-random trees in Monte Carlo, Parallel Comput. 1 (1984) 175-180.
3. A. De Matteis, S. Pagnutti, Parallelization of random number generators and long-range correlations, Parallel Comput. 15 (1990) 155-164.
4. O.E. Percus, M.H. Kalos, Random number generators for MIMD parallel processors, J. Par. Distr. Comput. 6 (1989) 477-497.
5. D.E. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, 2nd edn., Addison-Wesley, Reading, MA, 1981.
6. M. Mascagni, S.A. Cuccaro, D.V. Pryor, M.L. Robinson, A fast, high-quality, and reproducible lagged-Fibonacci pseudorandom number generator, J. Comput. Phys. 19 (1995) 211-219.
7. D.V. Pryor, S.A. Cuccaro, M. Mascagni, M.L. Robinson, Implementation and usage of a portable and reproducible parallel pseudorandom number generator, in: Proceedings of Supercomputing '94, IEEE, 1994, pp. 311-319.
8. L. Kuipers, H. Niederreiter, Uniform Distribution of Sequences, Wiley, New York, 1974.
9. R. Lidl, H. Niederreiter, Introduction to Finite Fields and their Applications, Cambridge Univ. Press, Cambridge, London, 1986.
10. H. Niederreiter, Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Am. Math. Soc. 84 (1978) 957-1041.
11. H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, SIAM, Philadelphia, PA, 1992.
12. W. Schmidt, Equations over finite fields: An elementary approach, in: Lecture Notes in Mathematics No. 536, Springer, Berlin, 1976.
13. M. Deleglise, J. Rivat, Computing π(x): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method, Math. Comput. 65 (1996) 235-245.
14. J.C. Lagarias, V.S. Miller, A.M. Odlyzko, Computing π(x): The Meissel-Lehmer method, Math. Comput. 55 (1985) 537-560.
15. n ± 1 b = 2, 3, 5, 7, 10, 11, 12 up to high powers, in: Contemporary Mathematics, Vol. 22, 2nd edn., American Mathematical Society, Providence, RI, 1988.
16. S.W. Golomb, Shift Register Sequences, Revised edn., Aegean Park Press, Laguna Hills, CA, 1982.
17. J. Spanier, E.M. Gelbard, Monte Carlo Principles and Neutron Transport Problems, Addison-Wesley, Reading, MA, 1969.
18. K.O. Bowman, M.T. Robinson, Studies of random number generators for parallel processing, in: Michael Heath (Ed.), Proceedings Second Conference on Hypercube Multiprocessors, SIAM, Philadelphia, PA, 1987, pp. 445-453.
19. P. L'Ecuyer, S. Côté, Implementing a random number package with splitting facilities, ACM Trans. Math. Soft. 17 (1991) 98-111.
20. A. De Matteis, S. Pagnutti, Long-range correlations in linear and non-linear random number generators, Parallel Comput. 14 (1990) 207-210.