2012/06/06 by Gleb Beliakov, Beliakov, Gleb, Michael Johnstone +5
Computer Science · Mathematics · #11K45 #65C10 #65Y05 #68W10 #Distributed #FOS: Computer and information sciences #FOS: Mathematics #Mathematical Software (cs.MS) #Numerical Analysis (math.NA) #Parallel #Probability (math.PR) #and Cluster Computing (cs.DC) #cs.DC #cs.MS #cs.NA #math.NA #math.PR #msc:11K45 #msc:65C10 #msc:65Y05 #msc:68W10
paper · pdf · doi:10.48550/arxiv.1206.1187
preprint, 18 pages
arxiv created 2012/06/22 · arxiv updated 2012/06/25
Pseudorandom number generators are required for many computational tasks, such as stochastic modelling and simulation. This paper investigates the serial CPU and parallel GPU implementation of a Linear Congruential Generator based on the binary representation of the normal number α2,3. We adapted two methods of modular reduction which allowed us to perform most operations in 64-bit integer arithmetic, improving on the original implementation based on 106-bit double-double operations. We found that our implementation is faster than existing methods in literature, and our generation rate is close to the limiting rate imposed by the efficiency of writing to a GPU's global memory.