Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!hellgate.utah.edu!caen!zaphod.mps.ohio-state.edu!samsung!crackers!m2c!umvlsi!dime!dime.cs.umass.edu!moss From: moss@cs.umass.edu (Eliot Moss) Newsgroups: comp.arch Subject: Re: Pseudo-random generation Message-ID: Date: 8 Feb 91 18:16:30 GMT References: <290001@hpprdea.HP.COM> Sender: news@dime.cs.umass.edu Reply-To: moss@cs.umass.edu Organization: Dept of Comp and Info Sci, Univ of Mass (Amherst) Lines: 16 In-reply-to: mortiz21@hpprdea.HP.COM's message of 5 Feb 91 20:49:37 GMT Assuming you mean pseudo-random *number* generation, may I suggest you start with the ACM article cited below? See also Knuth, "The Art of Computer Programming", Volume 2 (Seminumerical Algorithms), from Addison-Wesley, for a more thorough treatment of the subject. "Efficient and Portable Combined Random Number Generators" by Pierre L'Ecuyer, Comm. of ACM, Vol 31, Number 6, June 1988. -- J. Eliot B. Moss, Assistant Professor Department of Computer and Information Science Lederle Graduate Research Center University of Massachusetts Amherst, MA 01003 (413) 545-4206, 545-1249 (fax); Moss@cs.umass.edu