BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T143140Z
LOCATION:B310
DTSTART;TZID=America/New_York:20241117T095000
DTEND;TZID=America/New_York:20241117T100000
UID:submissions.supercomputing.org_SC24_sess737_ws_ia113@linklings.com
SUMMARY:Batch Updates of Distributed Streaming Graphs using Linear Algebra
DESCRIPTION:Elaheh Hassani, Md Taufique Hussain, and Ariful Azad (Indiana 
 University)\n\nWe develop a distributed-memory parallel algorithm for perf
 orming batch updates on streaming graphs, where vertices and edges are con
 tinuously added or removed. Our algorithm leverages distributed sparse mat
 rices as the core data structures, utilizing equivalent sparse matrix oper
 ations to execute graph updates. By reducing unnecessary communication amo
 ng processes and employing shared-memory parallelism, we accelerate update
 s of distributed graphs. Additionally, we maintain a balanced load in the 
 output matrix by permuting the resultant matrix during the update process.
  We demonstrate that our streaming update algorithm is at least 25 times f
 aster than alternative linear-algebraic methods and scales linearly up to 
 4,096 cores (32 nodes) on a Cray EX supercomputer.\n\nTag: Graph Algorithm
 s, Heterogeneous Computing, Programming Frameworks and System Software\n\n
 Registration Category: Workshop Reg Pass\n\nSession Chairs: Michela Becchi
  (North Carolina State University); John Feo (Pacific Northwest National L
 aboratory (PNNL)); Antonino Tumeo (Pacific Northwest National Laboratory (
 PNNL)); and Ana Lucia Varbanescu (University of Twente, Netherlands; Unive
 rsity of Amsterdam, Netherlands)\n\n
END:VEVENT
END:VCALENDAR