|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Automatic SIMD vectorization for Haskell
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:
Note that ex-directory lists are not shown.
Other listsSoul Food Religion, Conflict and its Aftermath All Faculty of Education Seminars
Other talksAn investigation of mecC Methicillin Resistant Staphylococcus aureus (MRSA) on Dairy Farms Simulating realistic disc galaxies with a novel sub-resolution ISM model Monogenic Pain Disorders Review of May Workshop/Setting the Scene Inferno XX, Purgatorio XX, Paradiso XX How does a bird know what nest to build?