Re: [Haskell-cafe] Re: New Benchmark Under Review: Magic Squares

2006-07-05 Thread Daniel Fischer
Am Mittwoch, 5. Juli 2006 15:50 schrieb Simon Marlow: > Malcolm Wallace wrote: > > Daniel Fischer <[EMAIL PROTECTED]> wrote: > >>Cool, though the problem of exploding runtime remains, it's only > >>pushed a little further. Now I get a 5x5 magig square in 1 s, a 6x6 > >>in 5.4 s, but 7x7 segfaulte

Re: [Haskell-cafe] Re: New Benchmark Under Review: Magic Squares

2006-07-05 Thread Bulat Ziganshin
Hello Simon, Wednesday, July 5, 2006, 5:50:58 PM, you wrote: > Mutable, boxed arrays in GHC have a linear GC overhead in GHC > unfortunately. This is partially fixed in GHC 6.6. > You can work around it by using either immutable or unboxed arrays, or immutable boxed array can still have large

[Haskell-cafe] Re: New Benchmark Under Review: Magic Squares

2006-07-05 Thread Simon Marlow
Malcolm Wallace wrote: Daniel Fischer <[EMAIL PROTECTED]> wrote: Cool, though the problem of exploding runtime remains, it's only pushed a little further. Now I get a 5x5 magig square in 1 s, a 6x6 in 5.4 s, but 7x7 segfaulted after about 2 1/2 hours - out of memory, I note that your solu