BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20181221T160904Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181113T083000
DTEND;TZID=America/Chicago:20181113T170000
UID:submissions.supercomputing.org_SC18_sess325_spost123@linklings.com
SUMMARY:Using Integrated Processor Graphics to Accelerate Concurrent Data 
 and Index Structures
DESCRIPTION:ACM Student Research Competition, Poster\nTech Program Reg Pas
 s, Exhibits Reg Pass\n\nUsing Integrated Processor Graphics to Accelerate 
 Concurrent Data and Index Structures\n\nFuentes\n\nWith the advent of comp
 uting systems with on-die integrated processor graphics (iGPU), new progra
 mming challenges have emerged from these heterogeneous systems. We propose
 d different data and index structure algorithms that can benefit from the 
 Intel's iGPU architecture and the C for Media (CM) programming model. We a
 im that certain data structures can run on the iGPU more efficiently than 
 the CPU cores, achieving important performance gains and energy savings. T
 o the best of our knowledge, this is the first attempt to use iGPU for run
 ning workloads on concurrent data and index structures. Experimental resul
 ts show speedups of up to 4x on concurrent data structures and 11x on inde
 x structures when comparing with state-of-the-art CPU implementations. Ene
 rgy savings of up to 300% are also obtained when running these algorithms 
 on iGPU.
URL:https://sc18.supercomputing.org/presentation/?id=spost123&sess=sess325
END:VEVENT
END:VCALENDAR