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:20230124T171527Z
LOCATION:C1-2-3
DTSTART;TZID=America/Chicago:20221117T083000
DTEND;TZID=America/Chicago:20221117T170000
UID:submissions.supercomputing.org_SC22_sess275_rpost153@linklings.com
SUMMARY:CANDY: An Efficient Framework for Updating Properties on Large Sca
 le Dynamic Networks
DESCRIPTION:Posters, Research Posters\n\nCANDY: An Efficient Framework for
  Updating Properties on Large Scale Dynamic Networks\n\nPandey, Khanda, Sr
 inivasan, Bhowmick, Das...\n\nQueries on large graphs use the stored graph
  properties to generate responses. As most of the real-world graphs are dy
 namic, i.e., the graph topology changes with time, and hence the related g
 raph properties are also time-varying. In such cases, maintaining correctn
 ess in stored graph properties requires recomputation or update on previou
 s properties. Here, we present an efficient framework, CANDY for updating 
 the properties in large dynamic networks. We prove the efficacy of our gen
 eral framework by applying it to update graph properties such as Single So
 urce Shortest Path (SSSP), Vertex Coloring, and PageRank. Empirically we s
 how that our shared-memory parallel and NVIDIA GPU-based data-parallel imp
 lementations perform better than the state-of-the-art implementations.\n\n
 Registration Category: Tech Program Reg Pass, Exhibits Reg Pass
END:VEVENT
END:VCALENDAR