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:20181221T160742Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181113T171500
DTEND;TZID=America/Chicago:20181113T190000
UID:submissions.supercomputing.org_SC18_sess343_drs111@linklings.com
SUMMARY:Using Integrated Processor Graphics to Accelerate Concurrent Data 
 and Index Structures
DESCRIPTION:Doctoral Showcase\nWorkshop Reg Pass, Tutorial Reg Pass, Tech 
 Program Reg Pass, Exhibits Reg Pass, Exhibits - Exhibit Hall Only Reg Pass
 \n\nUsing Integrated Processor Graphics to Accelerate Concurrent Data and 
 Index Structures\n\nFuentes, Scherson\n\nWith the advent of computing syst
 ems with on-die integrated processor graphics (iGPU), new programming chal
 lenges have emerged from these heterogeneous systems. We proposed differen
 t data and index structure algorithms that can benefit from the Intel's iG
 PU architecture and the C for Media (CM) programming model. We aim that ce
 rtain data structures can run on the iGPU more efficiently than the CPU co
 res, achieving important performance gains and energy savings. To the best
  of our knowledge, this is the first attempt to use iGPU for running workl
 oads on concurrent data and index structures. Experimental results show sp
 eedups of up to 4x on concurrent data structures and 11x on index structur
 es when comparing with state-of-the-art CPU implementations. Energy saving
 s of up to 300% are also obtained when running these algorithms on iGPU.
URL:https://sc18.supercomputing.org/presentation/?id=drs111&sess=sess343
END:VEVENT
END:VCALENDAR