A review of portable random number generators
Computers & GeosciencesPublished 1 January 1992
W. E. Sharp, Carter Bays
Citations12
SJR quartileQ1
SJR score1.04
SNIP1.49
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Abstract Portable random number generators for personal computers can be evaluated quickly and effectively by plotting their two- and three-dimensional serial patterns. An examination of about 40 published generators yielded only a few that had acceptable serial patterns.
Keywords
Computer Science
Computers in PhysicsSavitzky-Golay Smoothing Filters
11,624 Citations1990William H. Press, Saul A. Teukolsky
Communications of the ACMRandom number generators: good ones are hard to find
1,263 Citations1988S. K. Park, Keith Miller
Practical and theoretical issues are presented concerning the design, implementation, and use of a good, minimal standard random number generator that will port to virtually all systems.
Statistics & Probability LettersToward a universal random number generator
309 Citations1990George Marsaglia, Arif Zaman +1 more
An approach towards a random number generator that passes all of the stringent tests for randomness the authors have put to it, and that is able to produce exactly the same sequence of uniform random variables in a wide variety of computers.
ACM Transactions on Mathematical SoftwareA More Portable Fortran Random Number Generator
268 Citations1979Linus Schrage
The program described here is an implementation of the generator described by Lewis et al. and indirectly attributed to D.H. Lehmer, and produces a sequence of positive integers, IX, by the recursion.
Journal of Computational and Applied MathematicsThoughts on pseudorandom number generators
81 Citations1990B. D. Ripley
Comments are recorded based on comparing generators across a wide range of machines at the Workshop on pseudorandom number generators.
ACM Transactions on Mathematical SoftwareImproving a Poor Random Number Generator
58 Citations1976Carter Bays, S. D. Durham
An algorithm which resembles the MacLaren-Marsaglia method, but which reqmres only one random number generator and less time is employed, and not only is the period lengthened, but local nonrandomness subsides.
INFORMS Journal on Applied AnalyticsRandom Number Generation on Microcomputers
34 Citations1984Doan T. Modianos, Robert C. Scott +1 more
Some vendor-supplied generators, including those on the Apple II+, Apple IIe, Osborne Executive, and IBM-PC, were so seriously flawed that they should not be used for simulation studies.
Communications of the ACMExtremely portable random number generator
25 Citations1969Joseph B. Kruskal
An extremely portable 8-line FORTRAN program is provided which is based on an important paper by Coveyou and MacPherson (1967) and compares well with the bounds established in the above mentioned paper.
Journal of Computational and Applied MathematicsUpper bounds for the Beyer ratios of linear congruential generators
2 Citations1990Jürgen Eichenauer‐Herrmann, Holger Grothe