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:20260522T150119Z
LOCATION:D161
DTSTART;TZID=America/Chicago:20181112T161000
DTEND;TZID=America/Chicago:20181112T163000
UID:submissions.supercomputing.org_SC18_sess158_ws_lasalss115@linklings.co
 m
SUMMARY:Low Thread-Count Gustavson: A Multithreaded Algorithm for Sparse M
 atrix-Matrix Multiplication Using Perfect Hashing
DESCRIPTION:James Elliott and Christopher Siefert (Sandia National Laborat
 ories)\n\nSparse matrix-matrix multiplication is a critical kernel for sev
 eral scientific computing applications, especially the setup phase of alge
 braic multigrid. The MPI+X programming model, which is growing in populari
 ty, requires that such kernels be implemented in a way that exploits on-no
 de parallelism. We present a single-pass OpenMP variant of Gustavson’s spa
 rse matrix-matrix multiplication algorithm designed for architectures (e.g
 . CPU or Intel Xeon Phi) with reasonably large memory and modest thread co
 unts (tens of threads, not thousands). These assumptions allow us to explo
 it perfect hashing and dynamic memory allocation achieve performance impro
 vements of up to 2x over third-party kernels for matrices derived from alg
 ebraic multigrid setup.\n\nTag: Algorithms, Heterogeneous Systems, Resilie
 ncy\n\nRegistration Category: Workshop Reg Pass\n\nSession Chairs: Vassil 
 Alexandrov (Hartree Centre, STFC); Jack Dongarra (University of Tennessee,
  Knoxville; Oak Ridge National Laboratory (ORNL)); Christian Engelmann (Oa
 k Ridge National Laboratory (ORNL)); and Al Geist (Oak Ridge National Labo
 ratory (ORNL))\n\n
END:VEVENT
END:VCALENDAR