[Haskell-cafe] Performance problem with random numbers
lennart at augustsson.net
Sun Oct 14 12:05:27 EDT 2007
The Mersenne twister should be able to split better than most. but I'm not
sure how efficient it is.
On 10/14/07, Isaac Dupree <isaacdupree at charter.net> wrote:
> Don Stewart wrote:
> > I've seen similar results switching to the SIMD mersenne twister C
> > implementation for randoms:
> > http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html
> > If there's interest, I can package up the bindings for hackage.
> looks nice... at least for those of us who have non-old computer
> CPUs.... Is there a decent way to implement 'split'? A way that doesn't
> take too long to run, and produces fairly independent generators?
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe