BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Automatic Identification and Parallelisation of General Reduction 
 Operations - Philip Ginsbach\, University of Edinburgh
DTSTART:20161123T151500Z
DTEND:20161123T161500Z
UID:TALK69268@talks.cam.ac.uk
CONTACT:Alan Mycroft
DESCRIPTION:Discovering and exploiting reduction parallelism hasbeen studi
 ed for many years but no current approach scales well beyond simplistic sc
 alar reductions with low\narithmetic intensity.\nIn this paper we develop 
 a new approach that automatically detects a wide class of performance crit
 ical reductions in established benchmark suites.\nThis approach is based o
 n a constraint formulation of the reduction idiom and has been implemented
  as an LLVM pass.\nWe use a customized constraint solver to identify progr
 am subsets that adhere to the constraint specification.\nOnce discovered\,
  we automatically generate parallel code to exploit the reduction.\nThis a
 pproach is robust and was evaluated on C versions of three well known benc
 hmark suites: NAS\, Parboil and Rodinia.\nWe detected 84 scalar reductions
  and 6 histograms\, outperforming existing approaches and show that exploi
 ting histograms gives significant performance\nimprovement.\n
LOCATION:SS03
END:VEVENT
END:VCALENDAR