Article View: comp.arch
Article #11525Re: generating random numbers
From: Herman Rubin
Date: Mon, 13 May 1991 09:44
Date: Mon, 13 May 1991 09:44
22 lines
1334 bytes
1334 bytes
In article <9105130247.AA09317@ucbvax.Berkeley.EDU>, jbs@WATSON.IBM.COM writes:
....................
> Even granting that Monte Carlo methods are important I remain
> unconvinced that:
> 1) The time spent generating random numbers dominates these
> computations.
Sometimes it does, and sometimes it doesn't.
> 2) Your proposed instructions would reduce the time it takes
> to generate the random numbers.
The algorithms I envision would definitely win, even with the present
architecture, if enough accuracy was wanted. But even a rather simple
algorithm, using on the average less than a dozen bits, is likely to
crawl on the present architecture.
--
Herman Rubin, Dept. of Statistics, Purdue Univ., West Lafayette IN47907-1399
Phone: (317)494-6054
hrubin@l.cc.purdue.edu (Internet, bitnet) {purdue,pur-ee}!l.cc!hrubin(UUCP)
Technical Details
Message-ID:
<12250@mentor.cc.purdue.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!sample.eng.ohio-state.edu!purdue!mentor.cc.purdue.edu!pop.stat.purdue.edu!hrubinReferences:
<9105130247.AA09317@ucbvax.Berkeley.EDU>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!sample.eng.ohio-state.edu!purdue!mentor.cc.purdue.edu!pop.stat.purdue.edu!hrubin From: hrubin@pop.stat.purdue.edu (Herman Rubin) Newsgroups: comp.arch Subject: Re: generating random numbers Message-ID: <12250@mentor.cc.purdue.edu> Date: 13 May 91 09:44:41 GMT References: <9105130247.AA09317@ucbvax.Berkeley.EDU> Sender: news@mentor.cc.purdue.edu Lines: 22