|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 listsCambridge University Engineering Department Talks Collaborative research: funding available for collaborative research out of Science and Technology Funding Council areas. CU Kazakh Society
Other talksHow bees find the right flowers Reporting and writing on EU Affairs in times of crisis Religion and Humour: The Islamic Feast of Sacrifice in Egyptian Cartoons Evolution of turbulence and buoyancy under strong rotation - the role of inertial waves in structure formation Prediction, Predestination and the Limits of Perception: Inferno XX, Purgatorio XX, Paradiso XX Osteoarchaeology in India: Present and Future Perspective