Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!decwrl!pa.dec.com!shlump.nac.dec.com!netrix.nac.dec.com!lan_csse
From: lan_csse@netrix.nac.dec.com (CSSE LAN Test Account)
Newsgroups: comp.unix.programmer
Subject: Re: looking for uniformly distributed (0..1] random number generator
Message-ID: <20125@shlump.nac.dec.com>
Date: 12 Feb 91 16:37:55 GMT
References: <16610@ogicse.ogi.edu> <MOSS.91Jan29091301@ibis.cs.umass.edu>
Sender: news@shlump.nac.dec.com
Distribution: na
Organization: Digital Equipment
Lines: 8

You should also read the article in the Oct 1988 CACM (v.31, no.10) by
Stephen K. Park and Keith W. Miller, titled "Random number generators: 
good ones are hard to find".  Among other things, they point out that
the common library routines on most systems use modular arithmetic with
masking, which is not acceptable, and so they should be replaced.  I've
implemented their (quite simple) example of a minimally-acceptable
uniformly-distributed 32-bit integer on everal systems.  It's each,
and it works quite well.