Fast, high-quality pseudo random number generators for heterogeneous computing

被引:0
|
作者
Barbone, Marco [1 ]
Gaydadjiev, Georgi [3 ]
Howard, Alexander [1 ]
Luk, Wayne [1 ]
Savvidy, George [2 ]
Savvidy, Konstantin [2 ]
Rose, Andrew [1 ]
Tapper, Alexander [1 ]
机构
[1] Imperial Coll London, London, England
[2] Inst Nucl & Particle Phys, Demokritos Natl Res Ctr, GR-15342 Athens, Greece
[3] Univ Groningen, Bernoulli Inst, Nijenborgh 9, NL-9747 AG Groningen, Netherlands
关键词
D O I
10.1051/epjconf/202429511010
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Random number generation is key to many applications in a wide variety of disciplines. Depending on the application, the quality of the random numbers from a particular generator can directly impact both computational performance and critically the outcome of the calculation. High-energy physics applications use Monte Carlo simulations and machine learning widely, which both require high-quality random numbers. In recent years, to meet increasing performance requirements, many high-energy physics workloads leverage GPU acceleration. While on a CPU, there exist a wide variety of generators with different performance and quality characteristics, the same cannot be stated for GPU and FPGA accelerators. On GPUs, the most common implementation is provided by cuRAND - an NVIDIA library that is not open source or peer reviewed by the scientific community. The highest-quality generator implemented in cuRAND is a version of the Mersenne Twister. Given the availability of better and faster random number generators, high-energy physics moved away from Mersenne Twister several years ago and nowadays MIXMAX is the standard generator in Geant4 via CLHEP. The MIXMAX original design supports parallel streams with a seeding algorithm that makes it especially suited for GPU and FPGA where extreme parallelism is a key factor. In this study we implement the MIXMAX generator on both architectures and analyze its suitability and applicability for accelerator implementations. We evaluated the results against "Mersenne Twister for a Graphic Processor" (MTGP32) on GPUs which resulted in 5, 13 and 14 times higher throughput when a 240, 17 and 8 sized vector space was used respectively. The MIXMAX generator coded in VHDL and implemented on Xilinx Ultrascale+ FPGAs, requires 50% fewer total Look Up Tables (LUTs) compared to a 32-bit Mersenne Twister (MT-19337), or 75% fewer LUTs per output bit. In summary, the state-of-the art MIXMAX pseudo random number generator has been implemented on GPU and FPGA platforms and the performance benchmarked.
引用
收藏
页数:8
相关论文
共 50 条
  • [41] Quantifiers for randomness of chaotic pseudo-random number generators
    De Micco, L.
    Larrondo, H. A.
    Plastino, A.
    Rosso, O. A.
    PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2009, 367 (1901): : 3281 - 3296
  • [42] INFERRING SEQUENCES PRODUCED BY PSEUDO-RANDOM NUMBER GENERATORS
    BOYAR, J
    JOURNAL OF THE ACM, 1989, 36 (01) : 129 - 141
  • [43] GPU Optimization of Pseudo Random Number Generators for Random Ordinary Differential Equations
    Riesinger, Christoph
    Neckel, Tobias
    Rupp, Florian
    Hinojosa, Alfredo Parra
    Bungartz, Hans-Joachim
    2014 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, 2014, 29 : 172 - 183
  • [44] MULTIPLICATIVE PSEUDO-RANDOM NUMBER GENERATORS WITH PRIME MODULUS
    SMITH, CS
    JOURNAL OF THE ACM, 1971, 18 (04) : 586 - &
  • [45] Utilization of the Discrete Chaotic Systems as the Pseudo Random Number Generators
    Senkerik, Roman
    Pluhacek, Michal
    Zelinka, Ivan
    Oplatkova, Zuzana Kominkova
    MODERN TRENDS AND TECHNIQUES IN COMPUTER SCIENCE (CSOC 2014), 2014, 285 : 155 - 164
  • [46] CHAOS, PSEUDO-RANDOM NUMBER GENERATORS AND THE RANDOM-WALK PROBLEM
    SORNETTE, D
    ARNEODO, A
    JOURNAL DE PHYSIQUE, 1984, 45 (12): : 1843 - 1857
  • [47] Generating High Quality Pseudo Random Number Using Evolutionary Methods
    Poorghanad, Alireza
    Sadr, Ali
    Kashanipour, Alireza
    2008 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, VOLS 1 AND 2, PROCEEDINGS, 2008, : 331 - +
  • [48] Generating Efficient and High-Quality Pseudo-Random Behavior on Automata Processors
    Wadden, Jack
    Brunelle, Nathan
    Wang, Ke
    El-Hadedy, Mohamed
    Robins, Gabriel
    Stan, Mircea
    Skadron, Kevin
    PROCEEDINGS OF THE 34TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD), 2016, : 622 - 629
  • [49] High-quality and Real-time Frame Interpolation on Heterogeneous Computing System
    Bao, Wenbo
    Zhang, Xiaoyun
    Chen, Li
    Gao, Zhiyong
    2017 IEEE INTERNATIONAL SYMPOSIUM ON BROADBAND MULTIMEDIA SYSTEMS AND BROADCASTING (BMSB), 2017, : 482 - 485
  • [50] Replication study challenges and new number formats for chaotic pseudo random number generators
    Hesseling, Carina
    Keller, Joerg
    IT-INFORMATION TECHNOLOGY, 2022, 64 (1-2): : 5 - 13