BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Automatic SIMD vectorization for Haskell - Dominic Orchard (Univer
 sity of Cambridge)
DTSTART:20130917T130000Z
DTEND:20130917T140000Z
UID:TALK47314@talks.cam.ac.uk
CONTACT:Dominic Orchard
DESCRIPTION:Expressing algorithms using immutable arrays greatly simplifie
 s the challenges of automatic SIMD vectorization\, since several important
  classes of dependency violations cannot occur. The Haskell programming la
 nguage provides libraries for programming with immutable arrays\, and comp
 iler support for optimizing them to eliminate the overhead of intermediate
  temporary arrays. We describe an implementation of automatic SIMD vectori
 zation in a Haskell compiler which gives significant vector speedups for a
  range of programs written in a natural programming style. We compare perf
 ormance with that of programs compiled by the Glasgow Haskell Compiler.\n\
 nThis is joint work with Leaf Petersen and Neal Glew (both Intel). This is
  an ICFP practice talk. 
LOCATION:SS03\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR