Sciweavers

Share
EGH
2010
Springer

GPU random numbers via the tiny encryption algorithm

8 years 2 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) are expected to cater general purpose and graphics applications alike. Such diversity adds to expected requirements of a RNG. A good GPU RNG should be able to provide repeatability, random access, multiple independent streams, speed, and random numbers free from detectable statistical bias. A specific application may require some if not all of the above characteristics at one time. In particular, we hypothesize that not all algorithms need the highest-quality random numbers, so a good GPU RNG should provide a speed quality tradeoff that can be tuned for fast low quality or slower high quality random numbers. We propose that the Tiny Encryption Algorithm satisfies all of the requirements of a good GPU Pseudo Random Number Generator. We compare our technique against previous approaches, and present an evaluation...
Fahad Zafar, Marc Olano, Aaron Curtis
Added 11 Feb 2011
Updated 11 Feb 2011
Type Journal
Year 2010
Where EGH
Authors Fahad Zafar, Marc Olano, Aaron Curtis
Comments (0)
books