What branch is that work in? I've not seen mention of it in the commit logs.  I'd really love to see how they're Doing it. 

Likewise, it's worth remarking that a carefullywritten simd primop that explicitly uses the instruction intrinsics can easily be 1.5-2x faster than auto vectorized simd code.  I've some examples I tested for matrix multiplication where the performance is robustly In that range. 


On Tuesday, July 2, 2013, Ryan Newton wrote:
Gosh, sorry, yes it's not obvious from the list of accepted papers:

"Automatic SIMD Vectorization for Haskell" Leaf Petersen, Dominic Orchard and Neal Glew

One of the authors has a link for it but it appears there's no preprint up yet:
    http://www.leafpetersen.com/leaf/publications.htm






On Tue, Jul 2, 2013 at 5:36 AM, Nicolas Trangez <nicolas@incubaid.com> wrote:
On Mon, 2013-07-01 at 12:05 -0400, Ryan Newton wrote:
> Err, GCC replacement.  But, ironically, GHC [backend] replacement as well,
> as of the recent ICFP paper.

Got a link or reference?

Nicolas


_______________________________________________
ghc-devs mailing list
ghc-devs@haskell.org
http://www.haskell.org/mailman/listinfo/ghc-devs