Sciweavers

Share
ICCS
2001
Springer

On Parallel Pseudo-Random Number Generation

9 years 6 months ago
On Parallel Pseudo-Random Number Generation
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 counterpart 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.
Chih Jeng Kenneth Tan
Added 29 Jul 2010
Updated 29 Jul 2010
Type Conference
Year 2001
Where ICCS
Authors Chih Jeng Kenneth Tan
Comments (0)
books