
- 1.S.L. Anderson, Random Number Generators on Vector Supercomputers and Other Advanced Architectures, SIAM Rev. 32, 221 (1990). Google Scholar
Digital Library
- 2.3. Apostolakis, P. Coddington and E. Marinari, New SIMD algorithms for cluster labeling on parallel computers, Int. J. Mod. Phys. C 4, 749 (1993).Google Scholar
Cross Ref
- 3.S.-J. Bae, S.H. Ko and P.D. Coddington, Parallel Wolff Cluster Algorithms, Int. J. Mod. Phys. C 6, 197 (1995).Google Scholar
Cross Ref
- 4.C.F. Baillie and P.D. Coddington, Cluster identification algorithms for spin models - sequential and parallel, Concurrency: Practice and Experience 3, 129 (1991). Google Scholar
Digital Library
- 5.C.F. Baillie and P.D. Coddington, Comparison of cluster algorithms for 2-D Potts models, Phys. Rev. B 43,Google Scholar
- 6.P.R. Bevington, Data Reduction and Error Analysis for the Physical Sciences, McGraw-Hill, New York, 1969.Google Scholar
- 7.K. Binder ed., Monte Carlo Methods in Statistical Physics, Springer-Verlag, Berlin, 1986; K. Binder and D.W. Heermann, Monte Carlo Simulation in Statistical Physics, Springer-Verlag, Berlin, 1988; H. Gould and J. Tobochnik, An Introduction to Computer Simulation Methods, Vol. 2, Addison-Wesley, Reading, Mass., 1988.Google Scholar
- 8.G. Brassard and P. Bratley, Algorithmics: Theory and Practice, Prentice Hall, Englewood Cliffs, N.J., 1988. Google Scholar
Digital Library
- 9.R.P. Brent, Uniform random number generators for supercomputers, Proc. of the 5th Australian Supercomputer Conference, Melbourne, 1992.Google Scholar
- 10.T.-W. Chin, Shift-register sequence random number generators on the hypercube concurrent computers, Proc. of the 3rd Conference on Hypercube Concurrent Computers and Applications, G. Fox ed., ACM Press, New York, 1988. Google Scholar
Digital Library
- 11.CM Fortran User's Guide, Thinking Machines Corporation, Reading, Mass., 1992.Google Scholar
- 12.CMMD Reference Manual, Thinking Machines Corporation, Cambridge, Mass., 1993.Google Scholar
- 13.CM Scientific Software Library, Thinking Machines Corporation, Reading, Mass., 1992.Google Scholar
- 14.P.D. Coddington, Analysis of Random Number Generators Using Monte Carlo Simulation, Int. J. Mod. Phys. C 5, 547 (1994).Google Scholar
Cross Ref
- 15.P.D. Coddington, Tests of random number generators using Ising modeI simulations, in Proc. of the 1995 US- Japan Bilateral Seminar on New Trends in Computer Simulations of Spin Systems, int. J. Mod. Phys. C 7, 295 (1996).Google Scholar
- 16.Paul D. Coddington, Random Number Generators for Parallel Computers, The NHSE Review, http://nhse, cs. rice. edu/NHSEreview/, 1996 Volume, Second Issue.Google Scholar
- 17.P.D. Coddington and C.F. Baillie, Cluster algorithms for spin models on MIMD parallel computers, Proc. of the 5th Annual Distributed Memory Computing Conference, eds. D.W. Walker and Q.F. Stout, IEEE Computer Society Press, Los Alamitos, California, 1990.Google Scholar
Cross Ref
- 18.P.D. Coddington and C.F. Baillie, Empirical relations between static and dynamic exponents for Ising model cluster algorithms, Phys. Rev. Lett. 68, 962 (1992).Google Scholar
Cross Ref
- 19.P.D. Coddington, S.-H. Ko, W.E. Mahoney and J.M. del Rosario, Monte Carlo Tests of Parallel Random Number Generators, in preparation.Google Scholar
- 20.S.A. Cuccaro, M. Mascagni and D.V. Pryor, Techniques for testing the quality of parallel pseudo-random number generators, in Proc. of the 7th SIAM Conf. on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1995, p. 279.Google Scholar
- 21.A. De Matteis and S. Pagnutti, Controlling correlations in parallel Monte Carlo, Parallel Computing 21, 73 (X995). Google Scholar
Digital Library
- 22.E.T. Dudewicz and T.G. Ralley, The Handbook of Random Number Generation and Testing with TESTRAND Computer Code, American Science Press, Columbus, Ohio, 1981.Google Scholar
- 23.A.E. Ferdinand and M.E. Fisher, Phys. Rev. 185, 832 (1969).Google Scholar
Cross Ref
- 24.A.M. Ferrenberg, D.P. Landau and Y.j. Wong, Monte Carlo simulations: Hidden errors from "good" random number generators, Phys. Rev. Lett. 69, 3382 (1992).Google Scholar
Cross Ref
- 25.T. Filk, M. Marcu and K. Fredenhagen, Long range correlations in random number generators and their influence on Monte Carlo simulations, Phys. Left. B165, 125 (1985).Google Scholar
- 26.M. Flanigan and P. Tamayo, A parallel cluster labeling method for Monte Carlo dynamics, Int. J. Mod. Phys. C 3, 1235 (1992).Google Scholar
Cross Ref
- 27.J. Flower and A. Kolawa, Express is not just a message passing system: Current and future directions in Express, Parallel Computing 20, 597 (1994). Google Scholar
Digital Library
- 28.G. Fox et al., Solving Problems on Concurrent Processors, VoI. 1, Prentice-Hall, Englewood Cliffs, 1988. Google Scholar
Digital Library
- 29.William Gropp, Ewing Lusk and Anthony Skjellum, Using MPI: Portable Parallel Programming with the Message-Passing Interface, MIT Press, Cambridge, Mass., 1994. Google Scholar
Digital Library
- 30.D.W. Heermann and A.N. Burkitt, Parallel Algorithms in Computational Science, Springer Verlag, Heidelberg, 1991. Google Scholar
Digital Library
- 31.A. Hoogland, A. Compagner and H.W.J. B15te, Smooth finite-size behavior of the three-dimensional Ising model, Physica 132A, 593 (1985).Google Scholar
Cross Ref
- 32.E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Rockville, Maryland, 1978. Google Scholar
Digital Library
- 33.F. James, A review of pseudorandom number generators, Comp. Phys. Comm. 60, 329 (1990).Google Scholar
Cross Ref
- 34.C. Kalle and S. Wansleben, Problems with the random number generator RANF implemented on the CDC CYBER 205, Comp. Phys. Comm. 33, 343 (1984).Google Scholar
- 35.S. Kirkpatrick and E. Stoll, A very fast shift-register sequence random number generator, J. Comput. Phys. 40, 517 (1981).Google Scholar
Cross Ref
- 36.C. Koelbel et al., The High Performance Fortran Hand. book, MIT Press, Cambridge, Mass., 1993. Google Scholar
Digital Library
- 37.D.E. Knuth, The Art of Computer Programming Vol. 2: Seminumerical Methods Addison-Wesley, Reading, Mass., 1981. Google Scholar
Digital Library
- 38.P. L'Ecuyer, Random numbers for simulation, Comm. ACM 33:10, 85 (1990). Google Scholar
Digital Library
- 39.G.A. Marsaglia, A current view of random number generators, in Computational Science and Statistics: The Interface, ed. L. Balliard, Elsevier, Amsterdam, 1985.Google Scholar
- 40.A. Milchev, K. Binder, D.W. Heermann, Fluctuations and lack of self-averaging in the kinetics of domain growth, Z. Phys. B 63, 521 (1986).Google Scholar
Cross Ref
- 41.MP Fortran User's Guide, Maspar Corporation, 1992.Google Scholar
- 42.G. Parisi and F. Rapuano, Effects of the random number generator on computer simulations, Phys. Lett. 157B, 301 (1985).Google Scholar
Cross Ref
- 43.S.K. Park and K.W. Miller, Random number generators: Good ones axe hard to find, Comm. ACM 31:10, 1192 (1988). Google Scholar
Digital Library
- 44.R.H. Swendsen and J.-S. Wang, Nonuniversal critical dynamics in Monte Carlo simulations, Phys. Rev. Lett. 58, 86 (1987).Google Scholar
Cross Ref
- 45.I. Vattulainen, T. Ala-Nissila and K. Kankaala, Physical models as tests of randomness, Phys. Rev. E 52, 3205 (1995).Google Scholar
Cross Ref
- 46.U. Wolff, Collective Monte Carlo updating for spin systems, Phys. Rev. Left. 62, 361 (1989).Google Scholar
Cross Ref
- 47.S. Wolfram, Random Sequence Generation by Cellular Automata, Adv. Appl. Math. 7, 123 (1986). Google Scholar
Digital Library
- 48.R.M. Ziff, Reduction of correlations in shift-register sequence random number generators using multiple feedback taps, unpublished.Google Scholar
Index Terms
Techniques for empirical testing of parallel random number generators
Recommendations
Testing parallel random number generators
Monte Carlo computations are considered easy to parallelize. However, the results can be adversely affected by defects in the parallel pseudorandom number generator used. A parallel pseudorandom number generator must be tested for two types of ...
Bit-Wise Behavior of Random Number Generators
In 1985, G. Marsaglia proposed the m-tuple test, a runs test on bits, as a test of nonrandomness of a sequence of pseudorandom integers. We try this test on the outputs from a large set of pseudorandom number generators and discuss the behavior of the ...
Occupancy Numbers in Testing Random Number Generators
The classical occupancy problem where n balls are placed in N cells is used for testing of random number generators. We show that the statistics of appropriately chosen occupancy numbers are incompatible with the statistics of manypseudorandom number ...





Comments