Lagged Fibonacci Random Number Generators for Distributed Memory Parallel Computers

Journal of Parallel and Distributed Computing

Volumn 45, Issue 1, 1997, Pages 1-12

  Aluru, Srinivas ^a  

^a New Mexico State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012581749     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1363     Document Type: Article

References (38)

1. S. Aluru, 1996, Parallel additive lagged Fibonacci random number generators, Proc. 10th International Conference on Supercomputing '96, 102, 108.
2. S. Aluru, 1995, Properties of binomial coefficients and implications to parallelizing lagged Fibonacci random number generators, Proc. Intl. Conf. Par. Proc. '95, III, 25, 28.
3. S. Aluru, 1991, Random number generators for parallel computers, Iowa State University.
4. Aluru S., Prabhu G. M., Gustafson J. A random number generator for parallel computers. Parallel Comput. 18:1992;839-847.
5. Anderson S. L. Random number generators on vector supercomputers and other advanced architectures. SIAM Rev. 32:June 1990;221-251.
6. K. O. Bowman, M. T. Robinson, 1987, Studies of random number generators for parallel processing, Proc. Second Conference on Hypercube Multiprocessors, 445, 453, SIAM, Philadelphia.
7. R. P. Brent, 1992, Uniform random number generators for supercomputers, Proc. 5th Australian Supercomputer Conference, 95, 104.
8. S. Chakrabarti, J. Demmel, K. Yelick, 1995, Modeling the benefits of mixed data and task parallelism, Proc. Symposium on Parallel Algorithms and Architectures, 74, 83.
9. Coddington P. D. Analysis of random number generators using Monte Carlo simulation. Int. J. Mod. Phys. C5:1994;547.
10. Collings B. J., Hembree G. B. Initializing generalized feedback shift register pseudorandom number generators. J. Assoc. Comput. Mach. 33:1986;706-711.
11. Deak I. Uniform random number generators for parallel computers. Parallel Comput. 15:1990;155-164.
12. W. Evans, B. Sugla, 1989, Parallel random number generation, Proc. Fourth Conference on Hypercubes.
13. Ferrenberg A. M., Landau D. P., Wong Y. J. Monte Carlo simulations: Hidden errors from "good" random number generators. Phys. Rev. Lett. 69:1992;3382.
14. Fine N. J. Binomial coefficients modulo a prime. Amer. Math. Monthly. 54:1947;589.
15. Fox G. Solving Problems on Concurrent Processors. Vol. I. General Techniques and Regular Problems. 1988;Prentice-Hall, Englewood Cliffs.
16. Glaisher J. W. L. On the residue of a binomial-theorem coefficient with respect to a prime modulus. Quart. J. Math. 30:1899;150.
17. Grassberger P. On correlations in "good" random number generators. Phys. Rev. Lett. 181:1993;43.
18. Kimball S. H. Odd binomial coefficients. Amer. Math. Monthly. 65:1958;368.
19. Knuth D. E. The Art of Computer Programming. Vol. 2. Seminumerical Algorithms. 1981;Addison-Wesley, Reading.
20. Knuth D. E. The Art of Computer Programming. Vol. 1. Fundamental Algorithms. 1973;Addison-Wesley, Reading.
21. Kumar V., Grama A., Gupta A., Karypis G. Introduction to Parallel Computing: Design and Analysis of Algorithms. 1994;Benjamin-Cummings, Redwood City.
22. Lewis T. G., Payne W. H. Generalized feedback shift register pseudorandom number algorithm. J. Assoc. Comput. Mach. 20:1973;456-468.
23. G. Marsaglia, 1985, A current view of random number generators, XVIth Conference on Computer Science and Statistics: The Interface, L. Billard, 3, 10.
24. Marsaglia G. The structure of linear congruential sequences. Zaremba Z. K. Applications of Number Theory to Numerical Analysis. 1972;Academic Press, New York.
25. Marsaglia G. Regularities in congruential random number generators. Numer. Math. 16:1970;8-10.
26. Marsaglia G. Random numbers fall mainly in the planes. Proc. Nat. Acad. Sci. 61:1968;25-28.
27. Marsaglia G., Tsay L. H. Matrices and the structure of random number sequences. Linear Algebra Appl. 67:1985;147-156.
28. Marsaglia G., Zaman A. A new class of random number generators. Ann. Appl. Probab. I. 3:1991;462-480.
29. Niederreiter H. A statistical analysis of generalized feedback shift register pseudorandom number generators. SIAM J. Sci. Statist. Comput. 8:1987;1035-1051.
30. Park S. K., Miller K. W. Random number generators: Good ones are hard to find. Comm. ACM. 31:1988;1192-1201.
31. Percus O. E., Kalos M. H. Random number generators for MIMD parallel processors. J. Parallel Distributed Comput. 6:1987;477-497.
32. D. V. Pryor, S. A. Cuccaro, M. Mascagni, M. L. Robinson, 1994, Implementation of a portable and reproducible pseudorandom number generator, Proc. Supercomputing '94, 311, 319.
33. Roberts J. B. On binomial coefficient residues. Can. J. Math. 9:1957;363.
34. H. F. Sharp, III, C. H. Still, 1990, Random number generation in the parallel environment, Proc. Fifth Conference on Distributed Memory Computing, 1, 378, 381.
35. Vattulainen I., Ala-Nissila T., Kankaala K. Physical tests for random numbers in simulations. Phys. Rev. Lett. 73:1994;2513.
36. Wolfram S. Geometry of binomial coefficients. Amer. Math. Monthly. 91:1984;566-571.
37. Zierler N. Primitive trinomials whose degree is a Mersenne exponent. Inform. and Control. 15:1969;67-69.
38. Zierler N., Brillhart J. On primitive trinomials (mod 2). Inform. and Control. 13:1968;541-554.