Abstract
Generating random numbers in parallel streams has significant applications in fields like simulation, machine learning, and deep learning. These applications often require the rapid generation of large volumes of random numbers in a way that is reproducible, portable, and efficient. This research specifies an enhanced approach to 64-bit random number generation, aiming to improve upon the standard CPU-based implementations of pseudo-random number generators (PRNGs) such as the Mersenne Twister. The proposed method involves a streamlined version of the algorithm that is designed for parallel execution on multi-core CPUs, with the goal of achieving substantial speed enhancements compared to existing algorithms. To achieve this, this work leverages a 2-state 3-neighborhood maximal length linear cellular automaton as the foundational model for the pseudo-random number generator (PRNG). Notably, the new generator successfully passes almost all benchmark empirical tests for randomness as specified by the NIST and Dieharder test suites and is at par with the Mersenne Twister.
This work is carried out as a project in the Summer School on Cellular Automata Technology 2023.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bhattacharjee, K., Das, S.: A search for good pseudo-random number generators: survey and empirical studies. Comput. Sci. Rev. 45, 100471 (2022)
Matsumoto, M., Nishimura, T.: Mersenne twister: a 623- dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. (TOMACS) 8(1), 3–30 (1998)
Wolfram, S.: Origins of randomness in physical systems. Phys. Rev. Lett. 55(5), 449 (1985)
L’Ecuyer, P., Nadeau-Chamard, O., Chen, Y.-F., Lebar, J.: Multiple streams with recurrence-based, counter-based, and splittable random number generators. In: 2021 Winter Simulation Conference (WSC), pp. 1–16. IEEE (2021)
Salmon, J.K., Moraes, M.A., Dror, R.O., Shaw, D.E.: Parallel random numbers: as easy as 1, 2, 3. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1–12 (2011)
More, N., Singh, S.K., Verma, N., Bhattacharjee, K.: Cellular automaton-based emulation of the mersenne twister. Complex Syst. 32(2), 139–169 (2023)
Jaleel, H.A., Kaarthik, S., Sathish, S., Bhattacharjee, K.: Multiple-stream parallel pseudo-random number generation with cellular automata. In: Manzoni, L., Mariot, L., Roy Chowdhury, D. (eds.) Cellular Automata and Discrete Complex Systems. AUTOMATA 2023. LNCS, vol. 14152, pp. 90–104. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-42250-8_7
Cattell, K.M., Muzio, J.C.: Table of Linear Cellular Automata for Minimal Weight Primitive Polynomials of Degrees Up to 300. University of Victoria, Department of Computer Science (1991)
Cattell, K., Zhang, S.: Minimal cost one-dimensional linear hybrid cellular automata of degree through 500. J. Electron. Test. 6(2), 255–258 (1995)
Brown, R.G., Eddelbuettel, D., Bauer, D.: Dieharder. Duke University Physics Department, Durham, NC. www.webhome.phy.duke.edu/~rgb/General/dieharder.php
Rukhin, A., et al.: A statistical test suite for random and pseudorandom number generators for cryptographic applications, volume 800–22 (revision 1a). National Institute of Standards and Technology, Technology Administration, U.S. Department of Commerce (2010)
Saito, M., Matsumoto, M.: SIMD-oriented fast mersenne twister: a 128-bit pseudorandom number generator. In: Keller, A., Heinrich, S., Niederreiter, H. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2006, pp. 607–622. Springer, Heidelberg (2006). https://doi.org/10.1007/978-3-540-74496-2_36
Acknowledgment
This work is partially supported by Start-up Research Grant (File number: SRG/2022/002098), SERB, Govt. of India. The authors are grateful to Prof. Sukanta Das for his valuable comments and guidance throughout the Summer School and even after, for completing this work. A special thanks to Subrata Paul for helping with the empirical tests.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bhattacharjee, K., Kumar, S. (2024). Cellular Automata Based Multiple Stream Parallel Random Number Generator for 64-Bit Computing. In: Dalui, M., Das, S., Formenti, E. (eds) Cellular Automata Technology. ASCAT 2024. Communications in Computer and Information Science, vol 2021. Springer, Cham. https://doi.org/10.1007/978-3-031-56943-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-031-56943-2_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-56942-5
Online ISBN: 978-3-031-56943-2
eBook Packages: Computer ScienceComputer Science (R0)