|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 listsApplied and Computational Analysis Graduate Seminar Cambridge Neurological Society Cambridge Statistics Discussion Group (CSDG)
Other talksExploration of Cooperative Asymmetric Catalysts Toward Efficient Synthesis of Therapeutics Rare Metabolic Disorders: detection, research, management and treatment TBC (SP Monday Seminar) What can gambling machine data tell us about betting behaviour? Science Makers: sensor networks New Directions in Anonymization: Permutation Paradigm, Verifiability by Subjects and Intruders, Transparency to Users