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_spost109@linklings.com
SUMMARY:Recursive Algebraic Coloring Engine
DESCRIPTION:Christie Louis Alappat (University of Erlangen-Nuremberg)\n\nM
 any iterative numerical methods for sparse systems and building blocks of 
 sparse linear algebra are difficult to parallelize due to data dependencie
 s. These may be loop-carried dependencies as they occur in solvers like Ga
 uss-Seidel or write conflicts as in symmetric sparse matrix vector.  Most 
 of the existing parallelization strategies suffer from low performance on 
 modern hardware, are matrix specific, or require tailored storage formats.
 \n\nIn this poster, we introduce a novel recursive level based algorithm c
 alled Recursive Algebraic Coloring (RAC), which achieves high hardware eff
 iciency on modern multi-core architectures and works with simple data form
 ats like compressed row storage. Method is implemented in a library called
  Recursive Algebraic Coloring Engine (RACE).  Thorough performance analysi
 s shows that RACE outperforms traditional multicoloring methods and Intel-
 MKL implementations with a factor of 2–2.5×. We are on par with Algebraic 
 Block Multicoloring for small matrices, while for large matrices we gain a
  factor of 1.5–2×.\n\nRegistration Category: Tech Program Reg Pass, Exhibi
 ts Reg Pass\n\n
END:VEVENT
END:VCALENDAR