Multiple-stream parallel pseudo-random number generation with cellular automata

DOI10.1007/978-3-031-42250-8_7MaRDI QIDQ6546073zbMATH OpenFDO

Authors Hanan Abdul Jaleel, Saran Kaarthik, Sailesh Sathish, Kamalika Bhattacharjee

Publication date 29 May 2024

zbMATH Keywords

graphics processing unit (GPU)pseudo-random number generator (PRNG)maximal-length cellular automatamultiple-stream parallel generator

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Parallel numerical computation (65Y05) Cellular automata (computational aspects) (68Q80) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Random numbers for parallel computers: requirements and methods, with emphasis on gpus
• Parallel application of hybrid DNA cellular automata for pseudorandom number generation
• An efficient implementation of Bailey and Borwein's algorithm for parallel random number generation on graphics processing units
• scientific article; zbMATH DE number 1728306
• Variants of Mersenne Twister suitable for graphic processors

Cites work

• (Imperfect) strategies to generate primitive polynomials over GF(2)
• A search for good pseudo-random number generators: survey and empirical studies
• Mersenne twister
• SIMD-oriented fast Mersenne twister: a 128-bit pseudorandom number generator
• TestU01

This page was built for publication: Multiple-stream parallel pseudo-random number generation with cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546073)