[Haskell-cafe] Performance problem with random numbers

Isaac Dupree isaacdupree at charter.net
Sat Oct 13 20:08:38 EDT 2007

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?


More information about the Haskell-Cafe mailing list