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:20260522T150110Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181114T083000
DTEND;TZID=America/Chicago:20181114T170000
UID:submissions.supercomputing.org_SC18_sess326_spost123@linklings.com
SUMMARY:Using Integrated Processor Graphics to Accelerate Concurrent Data 
 and Index Structures
DESCRIPTION:Joel Fuentes (University of California, Irvine)\n\nWith the ad
 vent of computing systems with on-die integrated processor graphics (iGPU)
 , new programming challenges have emerged from these heterogeneous systems
 . We proposed different data and index structure algorithms that can benef
 it from the Intel's iGPU architecture and the C for Media (CM) programming
  model. We aim that certain data structures can run on the iGPU more effic
 iently than the CPU cores, achieving important performance gains and energ
 y savings. To the best of our knowledge, this is the first attempt to use 
 iGPU for running workloads on concurrent data and index structures. Experi
 mental results show speedups of up to 4x on concurrent data structures and
  11x on index structures when comparing with state-of-the-art CPU implemen
 tations. Energy savings of up to 300% are also obtained when running these
  algorithms on iGPU.\n\nRegistration Category: Tech Program Reg Pass, Exhi
 bits Reg Pass\n\n
END:VEVENT
END:VCALENDAR