[Haskell-cafe] Performance problem with random numbers

[Lennart Augustsson]

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?
>
> Isaac
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20071014/5d535c89/attachment.htm