\begin{thebibliography}{10} \bibitem[Aloisio:91a]{Aloisio:91a} Aloisio, G., Fox, G.~C., Kim, J.~S., and Veneziani, N. \newblock ``A concurrent implementation of the prime factor algorithm on a hypercube,'' {\em {IEEE Trans. ASSP}}, 39(1):160--170, January 1991. \newblock Caltech Report C3P-468b. \bibitem[Aloisio:91b]{Aloisio:91b} Aloisio, G., Lopinto, E., Veneziani, N., Fox, G.~C., and Kim, J.~S. \newblock ``Two approaches to the concurrent implementation of the prime factor algorithm on a hypercube,'' {\em Concurrency: Practice and Experience}, 3(5):483--495, October 1991. \newblock Caltech Report C3P-874. \bibitem[Aluru:92a]{Aluru:92a} Aluru, S., Prabhu, G.~M., and Gustafson, J. \newblock ``A random number generator for parallel computers,'' {\em Parallel Computing}, 18:839, 1992. \bibitem[Anderson:90d]{Anderson:90d} Anderson, S.~L. \newblock ``Random number generators on vector supercomputers and other advanced architectures,'' {\em SIAM Rev.}, 32:221, 1990. \bibitem[Barber:85a]{Barber:85a} {Barber, M. N., et al.} {\em Phys. Rev. B}, 32:1720, 1985. \bibitem[Chiu:88b]{Chiu:88b} Chiu, T.~W. \newblock ``Shift-register sequence random number generators on the hypercube concurrent computers,'' in G.~C. Fox, editor, {\em The Third Conference on Hypercube Concurrent Computers and Applications, Volume 2}, pages 1421--1429. ACM Press, New York, January 1988. \newblock Caltech Report C3P-526. \bibitem[Coddington:94a]{Coddington:94a} Coddington, P.~D. \newblock ``Analysis of random number generators using {Monte Carlo} simulation,'' {\em Int. J. Mod. Phys. C.}, 1994. \newblock To Appear. Syracuse University Technical Report SCCS-526. \bibitem[Dagum:92a]{Dagum:92a} Dagum, L. \newblock ``Data parallel sorting for particle simulation,'' {\em Concurrency: Practice and Experience}, 4(3):241--255, May 1992. \bibitem[Evans:89a]{Evans:89a} Evans, W., and Sugla, B. \newblock ``Parallel random number generation,'' in J.~L. Gustafson, editor, {\em The Proceedings of the Fourth Conference on Hypercubes, Concurrent Computers and Applications}, page 415. Golden Gate Enterprises, Los Altos, CA, March 1989. \bibitem[Ferrenberg:92a]{Ferrenberg:92a} Ferrenberg, A.~M., Landau, D.~P., and Wong, Y.~J. \newblock ``{Monte Carlo} simulations: Hidden errors from ``good'' random number generators,'' {\em Phys. Rev. Lett.}, 69:3382, 1992. \bibitem[Filk:85a]{Filk:85a} Filk, T., Marcu, M., and Fredenhagen, K. \newblock ``Long range correlations in random number generators and their influence on {Monte Carlo} simulations,'' {\em Phys. Lett. B}, 165:125, 1985. \bibitem[Fishman:90a]{Fishman:90a} Fishman, G.~S. \newblock ``Multiplicative congruential random number generators with modulus {$2^\beta$}: An exhaustive analysis for {$\beta \! = \! 32$} and a partial analysis for {$\beta \! = \! 48$},'' {\em Math. Comp.}, 54:331, 1990. \bibitem[Fox:87b]{Fox:87b} Fox, G. \newblock {\em Domain Decomposition in Distributed and Shared Memory Environments---I: A Uniform Decomposition and Performance Analysis for the {nCUBE} and {JPL Mark~IIIfp Hypercubes}}, volume 297 of {\em Lecture Notes in Computer Science}, pages 1042--1073. \newblock Springer-Verlag, New York, 1987. \newblock Supercomputing, ed. E. N. Houstis, T. S. Papatheodorou, and C. D. Polychronopoulos. \newblock Caltech Report C3P-392. \bibitem[Fox:88a]{Fox:88a} Fox, G.~C., Johnson, M.~A., Lyzenga, G.~A., Otto, S.~W., Salmon, J.~K., and Walker, D.~W. \newblock {\em Solving Problems on Concurrent Processors}, volume~1. \newblock Prentice-Hall, Inc., Englewood Cliffs, NJ, 1988. \bibitem[Grassberger:93a]{Grassberger:93a} Grassberger, P. \newblock ``On correlations in ``good'' random number generators.'' Technical Report WUB 93-03, Wuppertal University, 1993. \bibitem[Heath:91a]{Heath:91a} Heath, M.~T., Ng, E., and Peyton, B.~W. \newblock ``Parallel algorithms for sparse linear systems,'' in {\em Parallel Algorithms for Matrix Computations}, pages 83--124. SIAM, Philadelphia, 1991. \bibitem[Hoogland:85a]{Hoogland:85a} Hoogland, A., Compagner, A., and {Bl\"ote}, H. W.~J. \newblock ``Smooth finite-size behavior of the three-dimensional {Ising} model,'' {\em Physica A}, 132:593, 1985. \bibitem[James:90a]{James:90a} James, F. \newblock ``A review of pseudorandom number generators,'' {\em Comp. Phys. Comm.}, 60:329, 1990. \bibitem[Kalle:84a]{Kalle:84a} Kalle, C., and Wansleben, S. \newblock ``Problems with the random number generator {RANF} implemented on the {CDC CYBER 205},'' {\em Comp. Phys. Comm.}, 33:343, 1984. \bibitem[Knuth:81a]{Knuth:81a} Knuth, D.~E. \newblock {\em The Art of Computer Programming}. \newblock Addison-Wesley, Reading, MA, 1981. \newblock Volume 2: Seminumerical Methods. \bibitem[LEcuyer:88a]{LEcuyer:88a} {L'Ecuyer}, P. \newblock ``Efficient and portable combined random number generators,'' {\em Comm. ACM}, 31(6):742, 1988. \bibitem[LEcuyer:90a]{LEcuyer:90a} {L'Ecuyer}, P. \newblock ``Random numbers for simulation,'' {\em Comm. ACM}, 33(10):85, 1990. \bibitem[LEcuyer:91a]{LEcuyer:91a} {L'Ecuyer}, P., and {C\^ot\'e}, S. \newblock ``Implementing a random number package and splitting facilities,'' {\em ACM Trans. Math. Soft.}, 17:98, 1991. \bibitem[Marsaglia:85a]{Marsaglia:85a} Marsaglia, G.~A. \newblock ``A current view of random number generators,'' in L.~Balliard, editor, {\em Computational Science and Statististics: The Interface}. Elsevier, Amsterdam, 1985. \bibitem[Milchev:86a]{Milchev:86a} Milchev, A., Binder, K., and Heermann, D.~W. \newblock ``Fluctuations and lack of self-averaging in the kinetics of domain growth,'' {\em Z. Phys. B}, 63:521, 1986. \bibitem[Parisi:85a]{Parisi:85a} Parisi, G., and Rapuano, F. \newblock ``Effects of the random number generator on computer simulations,'' {\em Phys. Lett. B}, 157:301, 1985. \bibitem[Park:88a]{Park:88a} Park, S.~K., and Miller, K.~W. \newblock ``Random number generators: Good ones are hard to find,'' {\em Comm. ACM}, 31(10):1192, 1988. \bibitem[Percus:88a]{Percus:88a} Percus, O.~E., and Percus, J.~K. \newblock ``Long range correlations in linear congruential generators,'' {\em J. Comput. Phys.}, 77:267, 1988. \bibitem[Peterson:88b]{Peterson:88b} Peterson, W.~P. \newblock ``Some vectorized random number generators for uniform, normal, and {Poisson} distributions for the {CRAY~X-MP},'' {\em J. Supercomput.}, 1:327, 1988. \bibitem[Peterson:94a]{Peterson:94a} Peterson, W.~P. \newblock ``Lagged {Fibonacci} series random number generators for the {NEC~SX-3},'' {\em Int. J. High Speed Comput.}, 1994. \newblock To Appear. \bibitem[TMC:92a]{TMC:92a} Thinking Machines Corporation, Cambridge, Massachusetts. \newblock {\em CM Fortran User's Guide}, 1992. \bibitem[TMC:92b]{TMC:92b} Thinking Machines Corporation, Cambridge, Massachusetts. \newblock {\em CM Scientific Software Library}, 1992. \bibitem[Vattulainen:93a]{Vattulainen:93a} {Vattulainen, I., et al.} \newblock ``A comparative study of some pseudorandom number generators.'' Technical Report HU-TFT-93-22, hep-lat 9304008, University of Helsinki, 1993. \bibitem[Venugopal:92a]{Venugopal:92a} Venugopal, S., and Naik, V.~K. \newblock ``{SHAPE}: A parallelization tool for sparse matrix computations.'' Technical Report RC 17899 (77448), IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY, January 1992. \bibitem[Venugopal:92b]{Venugopal:92b} Venugopal, S., Naik, V.~K., and Saltz, J. \newblock ``Performance of distributed sparse {Cholesky} factorization with pre-scheduling.'' Technical Report RC 18623 (78732), IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY, April 1992. \bibitem[Wolfram:86c]{Wolfram:86c} Wolfram, S. \newblock ``Random sequence generation by cellular automata,'' {\em Adv. Appl. Math.}, 7:123, 1986. \end{thebibliography}