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

[Peter Verswyvelen]

Might also mean bad alignment of data structures, maybe when marshalling
data between the GHC runtime and the C implementation? If I recall correctly
SSE2 requires 16-byte alignment.
On Thu, Feb 26, 2009 at 5:24 PM, Don Stewart <dons at galois.com> wrote:

> Alistair.Bayley:
> > > From: haskell-cafe-bounces at haskell.org
> > > [mailto:haskell-cafe-bounces at 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
> _______________________________________________
> 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/20090226/4ecf8270/attachment.htm