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:20181221T160906Z
LOCATION:C145
DTSTART;TZID=America/Chicago:20181114T150000
DTEND;TZID=America/Chicago:20181114T170000
UID:submissions.supercomputing.org_SC18_sess468_spost109@linklings.com
SUMMARY:Recursive Algebraic Coloring Engine
DESCRIPTION:ACM Student Research Competition, Poster\nStudent Program, Tec
 h Program Reg Pass, ACM Student Research Competition\n\nRecursive Algebrai
 c Coloring Engine\n\nAlappat\n\nMany iterative numerical methods for spars
 e systems and building blocks of sparse linear algebra are difficult to pa
 rallelize due to data dependencies. These may be loop-carried dependencies
  as they occur in solvers like Gauss-Seidel or write conflicts as in symme
 tric sparse matrix vector.  Most of the existing parallelization strategie
 s 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 called Recursive Algebraic Coloring (RAC),
  which achieves high hardware efficiency on modern multi-core architecture
 s and works with simple data formats like compressed row storage. Method i
 s implemented in a library called Recursive Algebraic Coloring Engine (RAC
 E).  Thorough performance analysis 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, w
 hile for large matrices we gain a factor of 1.5–2×.
URL:https://sc18.supercomputing.org/presentation/?id=spost109&sess=sess468
END:VEVENT
END:VCALENDAR