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:20210402T160559Z
LOCATION:Track 8
DTSTART;TZID=America/New_York:20201113T170500
DTEND;TZID=America/New_York:20201113T171000
UID:submissions.supercomputing.org_SC20_sess227_pec320@linklings.com
SUMMARY:Linear Algebraic Graphs Algorithms in Python
DESCRIPTION:Workshop\n\nLinear Algebraic Graphs Algorithms in Python\n\nKa
 zmi\n\nGraph algorithms are a central part of many applications, and their
  speed is critical in real world use. Linear Algebraic formulations have b
 een shown to provide speedups, and the GraphBLAS standard provides their b
 uilding blocks.\n\nGraphBLAS does not cover everything, though, and it can
  be difficult to formulate a problem in linear algebra. In such cases, we 
 must implement graph algorithm code by hand. To investigate Python’s perfo
 rmance, I implemented Floyd Warshall’s algorithm in Python in two ways: Nu
 mba and Cython. I will compare these to more efficient C++/CUDA code, whic
 h was developed over several months by Vijay Thakkar, a graduate student i
 n our lab.\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR