[Haskell-cafe] Re: seg-fault in mersenne-random with SSE2 (was Performance question)

Alistair.Bayley:

...

From: haskell-cafe-bounces@haskell.org [mailto:haskell-cafe-bounces@haskell.org] On Behalf Of Roel van Dijk

I replaced the standard random number generated with the one from mersenne-random. On my system this makes the resulting program about 14 times faster than the original. I also made a change to accumulateHit because it doesn't need to count to total. That is already known.

I tried this too, but got a seg fault (!), so I stripped it back to a small test program. This is with mersenne-random, setup configured with -fuse_sse2:

This in the past has always meant: wrong architecture (or GCC can't handle sse2 on your system) -- Don