Access the full text.
Sign up today, get DeepDyve free for 14 days.
O. Percus, M. Kalos (1989)
Random Number Generators for MIMD Parallel ProcessorsJ. Parallel Distributed Comput., 6
M. Litzkow, M. Livny, M. Mutka (1988)
Condor-a hunter of idle workstations[1988] Proceedings. The 8th International Conference on Distributed
R. Lidl, H. Niederreiter (1994)
Introduction to finite fields and their applications: Theoretical Applications of Finite Fields
L. Kuipers (1974)
Uniform distribution of sequences
S. Tezuka (1995)
Uniform Random Numbers: Theory and Practice
P. Beale (1996)
Exact distribution of energies in the two-dimensional ising model.Physical review letters, 76 1
M. Mascagni (1999)
Serial and Parallel Random Number Generation
H. Niederreiter (1992)
Random number generation and Quasi-Monte Carlo methods, 63
W. Schmidt (1976)
Equations over Finite Fields: An Elementary Approach
G. Marsaglia, Liang-Huei Tsay (1985)
Matrices and the structure of random number sequencesLinear Algebra and its Applications, 67
(1985)
A current view of random number generators," in Computing Science and Statistics: Proceedings of the XVIth Symposium on the Interface, pp
K. Entacher (1998)
Bad subsequences of well-known linear congruential pseudorandom number generatorsACM Trans. Model. Comput. Simul., 8
P. L'Ecuyer, S. Côté (1991)
Implementing a random number package with splitting facilitiesACM Trans. Math. Softw., 17
D. Ferguson, J. Siepmann, D. Truhlar (1999)
Monte carlo methods in chemical physics
M. Deléglise, J. Rivat (1996)
Computing pi(x): the Meissel, Lehmer, Lagarias, Miller, Odlyzko methodMath. Comput., 65
P. Coddington (1996)
TESTS OF RANDOM NUMBER GENERATORS USING ISING MODEL SIMULATIONSInternational Journal of Modern Physics C, 07
S. Park, K. Miller (1988)
Random number generators: good ones are hard to findCommun. ACM, 31
M. Mascagni (1998)
Parallel Linear Congruential Generators with Prime ModuliParallel Comput., 24
P. Coddington (1993)
Analysis of random number generators using Monte Carlo simulationInternational Journal of Modern Physics C, 05
M. Mascagni (1999)
Some Methods of Parallel Pseudorandom Number Generation
D. Pryor, S. Cuccaro, M. Mascagni, M. Robinson (1994)
Implementation of a portable and reproducible parallel pseudorandom number generatorProceedings of Supercomputing '94
P. Coddington (1997)
Random Number Generators for Parallel Computers
H. Niederreiter (1994)
On a new class of pseudorandom numbers for simulation methodsJournal of Computational and Applied Mathematics, 56
(1999)
Parallel Monte Carlo in a distributed environment: SPRNG and condor
(2000)
ACM Transactions on Mathematical Software
J. Massey (1969)
Shift-register synthesis and BCH decodingIEEE Trans. Inf. Theory, 15
M. Mascagni, S. Cuccaro, D. Pryor, M. Robinson (1995)
A Fast, High Quality, and Reproducible Parallel Lagged-Fibonacci Pseudorandom Number GeneratorJournal of Computational Physics, 119
J. Lagarias, V. Miller, A. Odlyzko (1985)
Computing n(X) the meissel-lehmer methodMathematics of Computation, 44
M. Matsumoto, T. Nishimura (1998)
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generatorACM Trans. Model. Comput. Simul., 8
P. L'Ecuyer (1990)
Random numbers for simulationCommun. ACM, 33
G. Marsaglia (1968)
Random numbers fall mainly in the planes.Proceedings of the National Academy of Sciences of the United States of America, 61 1
J. Makino (1994)
Lagged-Fibonacci Random Number Generators on Parallel ComputersParallel Comput., 20
A. Matteis, S. Pagnutti (1990)
A class of parallel random number generatorsParallel Comput., 13
M. Mascagni, M. Robinson, D. Pryor, S. Cuccaro (1995)
Parallel Pseudorandom Number Generation Using Additive Lagged-Fibonacci Recursions
(1995)
The pLab www-server. Available at: http://random.mat.sbg.ac.at. Also accessible via ftp
T. Lewis, W. Payne (1973)
Generalized Feedback Shift Register Pseudorandom Number AlgorithmJ. ACM, 20
M. Matsumoto, Y. Kurita (1992)
Twisted GFSR generatorsACM Trans. Model. Comput. Simul., 2
Takashi Kato, Li-Ming Wu, N. Yanagihara (1996)
On a nonlinear congruential pseudorandom number generatorMath. Comput., 65
(1949)
Mathematical methods in large-scale computing units
P. Grassberger (1993)
On correlations in “good” random number generatorsPhysics Letters A, 181
P. Frederickson, R. Hiromoto, T. Jordan, Burton Smith, T. Warnock (1984)
Pseudo-random trees in Monte CarloParallel Comput., 1
(1995)
and M
D. Knuth (1970)
The Art of Computer Programming, Volume II: Seminumerical Algorithms
A. Matteis, S. Pagnutti (1995)
Controlling Correlations in Parallel Monte CarloParallel Comput., 21
(1998)
November Algorithm
H. Niederreiter (1988)
Low-discrepancy and low-dispersion sequencesJournal of Number Theory, 30
S. Cuccaro, M. Mascagni, D. Pryor (1995)
Techniques for Testing the Quality of Parallel Pseudorandom Number Generators
P. L'Ecuyer (1994)
Uniform random number generationAnnals of Operations Research, 53
Jack Okorn (2017)
Random NumbersComputational Statistical Physics
I. Vattulainen, T. Ala‐Nissila, K. Kankaala (1994)
Physical tests for random numbers in simulations.Physical review letters, 73 19
Alan Ferrenberg, D. Landau, Y. Wong (1992)
Monte Carlo simulations: Hidden errors from "good" random number generators.Physical review letters, 69 23
I. Vattulainen, I. Vattulainen (1999)
Framework for testing random numbers in parallel calculations.Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics, 59 6
J. Brillhart, D. Lehmer, J. Selfridge, B. Tuckerman, S. Wagstaff (1985)
Factorizations of b[n]±1, b=2, 3, 5, 6, 7, 10, 11, 12 up to high powersMathematics of Computation, 22
A. Matteis, S. Pagnutti (1988)
Parallelization of random number generators and long-range correlationsNumerische Mathematik, 53
W. Selke, A. Talapov, L. Shchur (1993)
Cluster-flipping Monte Carlo algorithm and correlations in good' random number generatorsJetp Letters, 58
I. Deák (1990)
Uniform random number generators for parallel computersParallel Comput., 15
A. Matteis, S. Pagnutti (1990)
Long-range correlations in linear and nonlinear random number generatorsParallel Comput., 14
R. Brent (1992)
Uniform random number generators for supercomputers
G. Marsaglia (1972)
The Structure of Linear Congruential Sequences
In this article we present background, rationale, and a description of the Scalable Parallel Random Number Generators (SPRNG) library. We begin by presenting some methods for parallel pseudorandom number generation. We will focus on methods based on parameterization, meaning that we will not consider splitting methods such as the leap-frog or blocking methods. We describe, in detail, parameterized versions of the following pseudorandom number generators: (1) linear congruential generators, (ii) shift-register generators, and (iii) lagged-Fibonacci generators. We briefly describe the methods, detail some advantages and disadvantages of each method, and recount results from number theory that impact our understanding of their quality of parallel applications. SPRNG was designed around the uniform implementation of different families of parameterized random number generators. We then present a short description of SPRNG. The description contained within this document is meant only to outline the rationale behind and the capabilities of SPRNG. Much more information, including examples and detailed documentation aimed at helping users with putting and using SPRNG on scalable systems is available at http://sprng.cs.fsu.edu. In this description of SPRNG we discuss the random-number generator library as well as the suite of tests of randomness that is an integral part of SPRNG. Random-number tools for parallel Monte Carlo applications must be subjected to classical as well as new types of empirical tests of randomness to eliminate generators that show defects when used in scalable environments.
ACM Transactions on Mathematical Software (TOMS) – Association for Computing Machinery
Published: Dec 1, 2000
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.