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: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:Joel Fuentes and Isaac Scherson (University of California, Irv
 ine)\n\nWith the advent of computing systems with on-die integrated proces
 sor graphics (iGPU), new programming challenges have emerged from these he
 terogeneous systems. We proposed different data and index structure algori
 thms that can benefit from the Intel's iGPU architecture and the C for Med
 ia (CM) programming model. We aim that certain data structures can run on 
 the iGPU more efficiently than the CPU cores, achieving important performa
 nce gains and energy savings. To the best of our knowledge, this is the fi
 rst attempt to use iGPU for running workloads on concurrent data and index
  structures. Experimental results show speedups of up to 4x on concurrent 
 data structures and 11x on index structures when comparing with state-of-t
 he-art CPU implementations. Energy savings of up to 300% are also obtained
  when running these algorithms on iGPU.\n\nRegistration Category: Workshop
  Reg Pass, Tutorial Reg Pass, Tech Program Reg Pass, Exhibits Reg Pass, Ex
 hibits - Exhibit Hall Only Reg Pass\n\n
END:VEVENT
END:VCALENDAR