Parallel additive lagged Fibonacci random number generators

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel additive lagged Fibonacci random number generators

Full text

Pdf (843 KB)

Source

International Conference on Supercomputing archive
Proceedings of the 10th international conference on Supercomputing table of contents

Philadelphia, Pennsylvania, United States

Pages: 102 - 108

Year of Publication: 1996

ISBN:0-89791-803-7

Author

Srinivas Aluru

School of Computer and Information Science, Syracuse University, Syracuse, NY

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 46, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237578.237591 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	S. Aluru, Properties o~ binomial cocfficicnts and implications to parallelizing lagged Fibonacci random number generators, Proc. Intl. Conf. Par. Proc. '!)5 (1995) III, 25-28.
	2	S. Aluru, Random number generators for parallel computers, M.S. Thesis, Iowa State University, Ames, Iowa, 1991.
	3	Srinivas Aluru , G. M. Prabhu , John Gustafson, A random number generator for parallel computers, Parallel Computing, v.18 n.9, p.839-847, Aug. 1992 [doi>10.1016/0167-8191(92)90030-B]
	4	Stuart L. Anderson, Random number generations generators on Vector supercomputers and other advanced architectures, SIAM Review, v.32 n.2, p.221-251, June 1990 [doi>10.1137/1032044]
	5	K.O. Bowman, and M.T. Robinson, Studies of random number generators for parallel processing, Proc. Second Conference on Hypercube Multiprocessors, M.T. Heath, ed., SIAM, Philadelphia (1987) 445-453.
	6	R.P. Brent, Uniform random number generators for supercomputers, Proc. 5th Australian Supercomputer Conference (1992) 95-104.
	7	P.D. Coddington, Analysis of random number generators using monte carlo simulation, Int. J. Mod. Phys., C 5 (1994) 547.
	8	I. Desk, Uniform random number generators for petallel computers, Parallel Cornput. 15 (1990) 155-164.
	9	W. Evans and B. Sugla, Parallel Random Number Generation, Proc. Fourth Conference on Hypercubes, Concurrent Computers f.4 Applications, Vol. i (1989) 415- 420.
	10	A.M. Ferrenberg, D.P. Landau and Y.J. Wong, Monte Carlo simulations: Hidden errors from "good" random number generators, Phys. Rev. Left., 69 (1992) 3382.
	11	Geoffrey C. Fox , Mark A. Johnson , Gregory A. Lyzenga , Steve W. Otto , John K. Salmon , David W. Walker, Solving problems on concurrent processors. Vol. 1: General techniques and regular problems, Prentice-Hall, Inc., Upper Saddle River, NJ, 1988
	12	P. Grassberger, On correlations in "good" random number generators, Phys. Rev. Left., 181 (1993) 43.
	13	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	14	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	15	Vipin Kumar , Ananth Grama , Anshul Gupta , George Karypis, Introduction to parallel computing: design and analysis of algorithms, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1994
	16	G. Marsaglia, A current view of random number generators, XVIth Conference on: Computer Science and Statistics: The Interface, L. Billard, ed. (1985) 3-10.
	17	G. Marsaglia, The structure of linear congruential sequences, In Applications of Number Theory to Numerical Analysis, Z.K.Zaremba, Ed., Academic Press, New York (1972).
	18	G. Marsaglia, Regularities in congruential random number generators, Numer. Math., 16 (1970) 8-10.
	19	G. Marsaglia, Random numbers fall mainly in the planes, Proc. Nat. Ace. Sci., 61 (1968), 25-28.
	20	G. Marsaglia and L.H. Tsay, Matrices and the structure of random number sequences, Linear Algebra Appl. 67 (1985) 147-156.
	21	G. Marsaglia, and A. Zaman, A new class of random number generators, Annals of Applied Probability I, 3(1991) 462-480.
	22	Harald Niederreiter, A statistical analysis of generalized feedback shift register pseudorandom number generators, SIAM Journal on Scientific and Statistical Computing, v.8 n.6, p.1035-1051, November 1, 1987 [doi>10.1137/0908084]
	23	S. K. Park , K. W. Miller, Random number generators: good ones are hard to find, Communications of the ACM, v.31 n.10, p.1192-1201, Oct. 1988 [doi>10.1145/63039.63042]
	24	Ora E. Percus , Malvin H. Kalos, Random number generators for MIMD parallel processors, Journal of Parallel and Distributed Computing, v.6 n.3, p.477-497, June 1989 [doi>10.1016/0743-7315(89)90002-6]
	25	Daniel V. Pryor , Steven A. Cuccaro , Michael Mascagni , M. L. Robinson, Implementation of a portable and reproducible parallel pseudorandom number generator, Proceedings of the 1994 conference on Supercomputing, p.311-319, December 1994, Washington, D.C., United States
	26	H.F. Sharp,III and C.H. Still, Random number generation in the parallel environment, Proc. Fifth Conference on Distributed Memory Computing, Vol. i (1990) 378- 381.
	27	I. Vattulainen, T. Ala.Nissila and K. Kankaala, Physical tests for random numbers in simulations, Phys. Rev. Left., 73 (1994) 2513.