Sprng: A scalable library for pseudorandom number generation

ACM Transactions on Mathematical Software

Volumn 26, Issue 3, 2000, Pages 436-461

  Mascagni, Michael ^b   Srinivasan, Ashok ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^b Florida State University   (United States)

Author keywords

Algorithms; Design; Documentation; Experimentation; Lagged fibonacci generator; Linear congruential generator; Parallel random number generators; Performance; Random number software; Random number tests; Reliability; Standardization

Indexed keywords

EID: 0001290917     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/358407.358427     Document Type: Article

References (61)

1. BEALE, P. 1996. Exact distribution of energies in the two-dimensional Ising model. Phys. Rev. Lett. 76, 78.
2. BRENT, R. P. 1992. Uniform random number generators for supercomputers. In Proceedings of the 5th on Australian Supercomputer Conference. 95-104.
3. BRENT, R. P. 1994. On the periods of generalized Fibonacci recurrences. Math. Comput. 63, 207 (July), 389-401.
4. n ±1 b = 2, 3, 5, 7, 10, 11, 12 up to high powers. In Contemporary Mathematics. American Mathematical Society, Boston, MA.
5. CODDINGTON, P. 1994. Analysis of random number generators using Monte Carlo simulation. Int. J. of Mod. Phys. C5, 3, 547-560.
6. CODDINGTON, P. 1996. Tests of random number generators using Ising model simulations. Int. J. of Mod. Phys. 7, 3, 295-303.
7. CODDINGTON, P. 1997. Random number generators for parallel computers. http://nhse.cs.rice.edu/NHSEreview/96-2.html.
8. CUCCARO, S. A., MASCAGNI, M., AND PRYOR, D. V. 1995. Techniques for testing the quality of parallel pseudorandom number generators. In Proceedings of the 7th SIAM Conference on Parallel Processing for Scientific Computing (San Francisco, Feb.). SIAM, Philadelphia, PA, 279-284.
9. DEÁK, I. 1990. Uniform random number generators for parallel computers. Parallel Comput. 15, 155-164.
10. DELEGLISE, M. AND RIVAT, J. 1996. Computing π(x): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method. Math. Comput. 65, 213, 235-245.
11. DE MATTEIS, A. AND PAGNUTTI, S. 1988. Parallelization of random number generators and long-range correlations. Numer. Math. 53, 5 (Aug.), 595-608.
12. DEMATTEIS, A. AND PAGNUTTI, S. 1990a. A class of parallel random number generators. Parallel Comput. 13, 193-198.
13. DE MATTEIS, A. AND PAGNUTTI, S. 1990b. Long-range correlations in linear and non-linear random number generators. Parallel Comput. 14, 207-210.
14. DE MATTEIS, A. AND PAGNUTTI, S. 1995. Controlling correlations in parallel Monte Carlo. Parallel Comput. 21, 1 (Jan.), 73-84.
15. EICHENAUER, J. AND LEHN, J. 1986. A nonlinear congruential pseudorandom number generator. Statist. Hefte 37, 315-326.
16. ENTACHER, K. 1998. Bad subsequences of well-known linear congruential pseudorandom number generators. ACM Trans. Model. Comput. Simul. 8, 1, 61-70.
17. FERRENBERG, A. M., LANDAU, D., AND WONG, Y. 1992. Monte Carlo simulations: Hidden errors from "good" random number generators. Phys. Rev. 69, 23, 3382-3384.
18. FREDERICKSON, P., HIROMOTO, R., JORDAN, T. L., SMITH, B., AND WARNOCK, T. 1984. Pseudo-random trees in Monte Carlo. Parallel Comput. 1, 175-180.
19. GOLOMB, S. W. 1967. Shift Register Sequences. Holden-Day, Inc., San Francisco, CA.
20. GRASSBERGER, P. 1993. On correlations in "good" random number generators. Phys. Lett. A 181, 1, 43-46.
21. HELLEKALEK, P., ENTACHER, K., LEEB, H., LENDL, O., AND WEGENKITTL, S. 1995. The pLab www-server. Available at: http://random.mat.sbg.ac.at. Also accessible via ftp. University of Salzburg, Salzburg, Austria.
22. KNUTH, D. E. 1997. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. 3rd ed. Addison-Wesley Longman Publ. Co., Inc., Reading, MA.
23. KUIPERS, L. AND NIEDERREITER, H. 1974. Uniform Distribution of Sequences. John Wiley and Sons, Inc., New York, NY.
24. LAGARIAS, J. C., MILLER, V. S., AND ODLYZKO, A. M. 1985. Computing π(x): The Meissel-Lehmer method. Math. Comput. 55, 537-560.
25. L'ECUYER, P. 1990. Random numbers for simulation. Commun. ACM 33, 1 (Jan.), 89-97.
26. L'ECUYER, P. 1994. Uniform random number generation. Ann. Oper. Res. 53, 77-120.
27. L'ECUYER, P. 1998. Random number generation. In Handbook of Simulation, J. Banks, Ed. John Wiley and Sons, Inc., New York, NY, 93-137.
28. L'ECUYER, P. AND CÔTÉ, S. 1991. Implementing a random number package with splitting facilities. ACM Trans. Math. Softw. 17, 1 (Mar.), 98-111.
29. LEHMER, D. H. 1949. Mathematical methods in large-scale computing units. In Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery (Cambridge, Massachusetts). Harvard University Press, Cambridge, MA, 141-146.
30. LEWIS, T. G. AND PAYNE, W. H. 1973. Generalized feedback shift register pseudorandom number algorithms. J. ACM 20, 456-468.
31. LIDL, R. AND NIEDERREITER, H. 1986. Introduction to finite fields and their applications. Cambridge University Press, New York, NY.
32. LITZKOW, M., LIVNY, M., AND MUTKA, M. W. 1998. Condor - a hunter of idle workstations. In Proceedings of the 8th International Conference on Distributed Computing Systems (June). 104-111.
33. MARINO, J. 1994. Lagged-Fibonacci random number generators on parallel computers. Parallel Comput. 20, 9 (Sept.), 1357-1367.
34. MARSAGLIA, G. 1968. Random numbers fall mainly in the planes. In Nat. Acad. Sci. U.S.A.. 25-28.
35. MARSAGLIA, G. 1972. The structure of linear congruential sequences. In Applications of Number Theory to Numerical Analysis, S. K. Zaremba, Ed. Academic Press, Inc., New York, NY, 249-285.
36. MARSAGLIA, G. 1985. A current view of random number generators. In Computing Science and Statistics: Proceedings of the XVIth Symposium on the Interface. 3-10.
37. MARSAGLIA, G. AND TSAY, L.-H. 1985. Matrices and the structure of random number sequences. Linear Alg. Appl. 67, 147-156.
38. MASCAGNI, M. 1997. A parallel non-linear Fibonacci pseudorandom number generator. In Proceedings of SIAM's 45th Anniversary Meeting (Stanford, CA, July 14-18). SIAM, Philadelphia, PA. Abstract
39. MASCAGNI, M. 1998. Parallel linear congruential generators with prime moduli. Parallel Comput. 24, 5-6, 923-936.
40. MASCAGNI, M. 1999a. Serial and parallel random number generation. In Quantum Monte Carlo in Physics and Chemistry, P. Nightingale and C. Umrigar, Eds. NATO ASI Series, Series C: Mathematical and Physical Sciences. Kluwer Academic, Dordrecht, Netherlands, 425-446.
41. MASCAGNI, M. 1999b. Some methods of parallel pseudorandom number generation. In Algorithms for Parallel Processing, M. Heath, A. Ranade, and R. Schreiber, Eds. IMA Volumes in Mathematics and Its Applications, vol. 105. Springer-Verlag, Vienna, Austria, 277-288.
42. MASCAGNI, M., CUCCARO, S. A., PRYOR, D. V., AND ROBINSON, M. L. 1995a. A fast, high quality, and reproducible parallel lagged-Fibonacci pseudorandom number generator. J. Comput. Phys. 119, 2 (July), 211-219.
43. MASCAGNI, M., ROBINSON, M. L., PRYOR, D. V., AND CUCCARO, S. A. 1995b. Parallel pseudorandom number generation using additive lagged-Fibonacci recursions. In Springer Lecture Notes in Statistics, vol. 106. 263-277.
44. MASSEY, J. L. 1969. Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theor. IT-15, 122-127.
45. MATSUMOTO, M. AND KURITA, Y. 1992. Twisted GFSR generators. ACM Trans. Model. Comput. Simul. 2, 3 (July), 179-194.
46. MATSUMOTO, M. AND NISHIMURA, T. 1998. Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8, 1. 3-30.
47. NIEDERREITER, H. 1988. Low-discrepancy and low-dispersion sequences. J. Number Theory 30, 51-70.
48. NIEDERREITER, H. 1992. Random Number Generation and Quasi-Monte Carlo Methods. CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 63. SIAM, Philadelphia, PA.
49. NIEDERREITER, H. 1994. On a new class of pseudorandom numbers for simulation methods. J. Comput. Appl. Math. 56, 1-2 (Dec. 20), 159-167.
50. PARK, S. K. AND MILLER, K. W. 1988. Random number generators: Good ones are hard to find. Commun. ACM 31, 10 (Oct.), 1192-1201.
51. PERCUS, O. E. AND KALOS, M. H. 1989. Random number generators for MIMD parallel processors. J. Parallel Distrib. Comput. 6, 3 (June), 477-497.
52. PRYOR, D. V., CUCCARO, S. A., MASCAGNI, M., AND ROBINSON, M. L. 1994. Implementation of a portable and reproducible parallel pseudorandom number generator. In Proceedings of the Conference on Supercomputing '94 (Washington, DC, Nov. 14-18), G. M. Johnson, Chair. IEEE Computer Society Press, Los Alamitos, CA, 311-319.
53. SCHMIDT, W. 1976. Equations over finite fields: An elementary approach. In Lecture Notes in Mathematics, vol. 536. Springer-Verlag, New York, NY.
54. SELKE, W., TALAPOV, A. L., AND SCHUR, L. N. 1993. Cluster-flipping Monte Carlo algorithm and correlations in "good" random number generators. JETP Lett. 58, 8, 665-668.
55. SRINIVASAN, A., CEPERLEY, D., AND MASCAGNI, M. 1999a. Random number generators for parallel applications. In Monte Carlo Methods in Chemical Physics, D. Ferguson, J. I. Siepmann, and D. G. Truhlar, Eds. Advances in Chemical Physics, vol. 105. John Wiley and Sons, Inc., New York, NY, 13-36.
56. SRINIVASAN, A., CEPERLEY, D., AND MASCAGNI, M. 1999b. Testing parallel random number generators.
57. TAUSWORTHE, R. C. 1965. Random numbers generated by linear recurrence modulo two. Adv. Comput. Math. 19, 201-209.
58. TEZUKA, S. 1995. Uniform Random Numbers: Theory and Practice. Kluwer Academic Publishers, Hingham, MA.
59. VATTULAINEN, I. 1999. Framework for testing random numbers in parallel calculations. Phys. Rev. 59, 7200-7204.
60. VATTULAINEN, I., ALA-NISSILA, T., AND KANKAALA, K. 1994. Physical tests for random numbers in simulations. Phys. Rev. Lett. 73, 19, 2513-2516.
61. ZHOU, M. AND MASCAGNI, M. 1999. Parallel Monte Carlo in a distributed environment: SPRNG and condor. In Proceedings of the 1st Southern Symposium on Computing.