Automatic SIMD vectorization for Haskell

Add to your list(s) Download to your calendar using vCal

• Dominic Orchard (University of Cambridge)
• Tuesday 17 September 2013, 14:00-15:00
• SS03, Computer Laboratory, William Gates Building.

If you have a question about this talk, please contact Dominic Orchard.

Expressing algorithms using immutable arrays greatly simplifies the challenges of automatic SIMD vectorization, since several important classes of dependency violations cannot occur. The Haskell programming language provides libraries for programming with immutable arrays, and compiler support for optimizing them to eliminate the overhead of intermediate temporary arrays. We describe an implementation of automatic SIMD vectorization in a Haskell compiler which gives significant vector speedups for a range of programs written in a natural programming style. We compare performance with that of programs compiled by the Glasgow Haskell Compiler.

This is joint work with Leaf Petersen and Neal Glew (both Intel). This is an ICFP practice talk.

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Programming Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• SS03, Computer Laboratory, William Gates Building
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.