[Haskell-cafe] Performance question
leimy2k at gmail.com
Thu Feb 26 12:54:09 EST 2009
How about an FFI call to rand() and then measure the performance
On Thu, Feb 26, 2009 at 3:37 AM, Felipe Lessa <felipe.lessa at gmail.com>wrote:
> On Thu, Feb 26, 2009 at 7:56 AM, Eugene Kirpichov <ekirpichov at gmail.com>
> > Here is a variant that uses mersenne-random-pure64 and works less than
> > 2x slower than C++:
> And I would like to notice that rand() is incredibly dumber than the
> Mersenne twister, so probably if we took rand()'s code from glibc and
> rewrote it in Haskell, there would be another performance increase.
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe