Abstract
Parallel computing has been touted as the pinnacle of high performance digital computing by many. However, many problems remain intractable using deterministic algorithms. Randomized algorithms which are, in some cases, less efficient than their deterministic counter-part for smaller problem sizes, can overturn the intractability of various large scale problems. These algorithms, however, require a source of randomness. Pseudo-random number generators were created for many of these purposes. When performing computations on parallel machines, an additional criterion for randomized algorithms to be worthwhile is the availability of a parallel pseudo-random number generator. This paper presents an efficient algorithm for parallel pseudo-random number generation.
Chapter PDF
Similar content being viewed by others
Keywords
References
Coddington, P. D. Analysis of Random Number Generators Using Monte Carlo Simulation. International Journal of Modern Physics C5 (1994).
Coddington, P. D. Random Number Generators for Parallel Computers. National HPCC Software Exchange Review, 1.1 (1997).
Knuth, D. E. The Art of Computer Programming, Volume II: Seminumerical Algorithms, 3 ed. Addison Wesley Longman Higher Education, 1998.
L’Ecuyer, P. Maximally Equidistributed Combined Tausworthe Generators. Mathematics of Computation 65, 213 (1996), 203–213.
Marsaglia, G. A Current View of Random Number Generators. In Computing Science and Statistics: Proceedings of the XVI Symposium on the Interface (1984).
Matsumoto, M., and Nishimura, T. Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator. ACM Transactions on Modeling and Computer Simulation 8, 1 (1998), 3–30.
Niederreiter, H. Random Number Generation and Quasi-Monte Carlo Methods. No. 63 in CMBS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics, 1992.
Srinivasan, A., Ceperley, D., and Mascagni, M. Testing Parallel Random Number Generators. In Proceedings of the Third International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (1998).
Tan, C. J. K. Efficient Parallel Pseudo-random Number Generation. In Proceedings of the 2000 International Conference on Parallel and Distributed Processing Techniques and Applications (2000), H. R. Arabnia, et al., Ed., vol. 1, CSREA Press.
Tan, C. J. K., and Alexandrov, V. N. Relaxed Monte Carlo Method for Solution of Systems of Linear Algebraic Equations. In Recent Advances in Computational Science (2001), V. N. Alexandrov, J. J. Dongarra, and C. J. K. Tan, Eds., vol. 2073 of Lecture Notes in Computer Science, Springer-Verlag.
Vattulainen, I., Ala-Nissila, T., and Kankaala, K. Physical Models as Tests of Randomness. Physics Review E52 (1995).
Williams, K. P., and Williams, S. A. Implementation of an Efficient and Powerful Parallel Pseudo-random Number Generator. In Proceedings of the Second European PVM Users’ Group Meeting (1995).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, C.J.K. (2001). On Parallel Pseudo-Random Number Generation. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science — ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45545-0_68
Download citation
DOI: https://doi.org/10.1007/3-540-45545-0_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42232-7
Online ISBN: 978-3-540-45545-5
eBook Packages: Springer Book Archive