Implementing a random number package with splitting facilities
- 1 March 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 17 (1) , 98-111
- https://doi.org/10.1145/103147.103158
Abstract
A portable set of software tools is described for uniform random variates generation. It provides for multiple generators running simultaneously, and each generator has its sequence of numbers partitioned into many long (disjoint) substreams. Simple procedure calls allow the user to make any generator “jump” ahead to the beginning of its next substream, back to the beginning of its current substream, or back to the beginning of its first substream.… Implementation issues are discussed.…A Pascal implementation for 32-bit computers is described. — From the Authors' AbstractKeywords
This publication has 7 references indexed in Scilit:
- Efficient and portable combined random number generatorsCommunications of the ACM, 1988
- A Guide to SimulationPublished by Springer Nature ,1987
- An improvement for the McGill University Random Number PackageComputational Statistics & Data Analysis, 1985
- Accuracy in random number generationMathematics of Computation, 1985
- Implementing a portable FORTRAN Uniform (0,1) generatorSIMULATION, 1983
- Algorithm AS 183: An Efficient and Portable Pseudo-Random Number GeneratorJournal of the Royal Statistical Society Series C: Applied Statistics, 1982
- Coding the Lehmer pseudo-random number generatorCommunications of the ACM, 1969