News for hackers. Stuff that matters.
Re:Haskell Beats C Using Generalized Stream Fusion [pdf] by ky3 on Sunday April 07, 2013 @09:53PM (#5509584)
There are 2 pieces of C benchmarked. The other one computes `a[i]-b[i]` into a temporary array and then makes a single call to BLAS. The speed is roughly half that of Haskell, which dispenses with the space cost of the temporary array.
Re:Haskell Beats C Using Generalized Stream Fusion [pdf] by jules on Monday April 08, 2013 @04:34AM (#5510582)
Yes, you're right, the other C code is even less efficient.
Re:Haskell Beats C Using Generalized Stream Fusion [pdf] by ky3 on Monday April 08, 2013 @03:40PM (#5514005)
Good catch! It's the 3x BLAS that's 1/2 of Haskell's speed.

The 1x BLAS that uses 2x RAM gets shafted, presumably by cache lossage.