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:20260202T201248Z
LOCATION:Second Floor Atrium
DTSTART;TZID=America/Chicago:20251120T080000
DTEND;TZID=America/Chicago:20251120T170000
UID:submissions.supercomputing.org_SC25_sess533_post208@linklings.com
SUMMARY:When Label Propagation Outperforms BFS in Breadth-First Graph Trav
 ersal
DESCRIPTION:Kalsuda Lapborisuth and Srinivas Aluru (Georgia Institute of T
 echnology)\n\nWe tackle the challenge of breadth-first traversal (BFT) on 
 sparse graphs with a high number of connected components. We propose a nov
 el distributed-memory parallel algorithm that uses the label propagation (
 LP) algorithm to perform BFT on all connected components of the graph simu
 ltaneously. In synthetic benchmarks with RMAT-like graphs, we show that ou
 r LP-based algorithm can be up to 77x faster compared to the parallel dire
 ction-optimized BFS in the Combinatorial BLAS library, while scaling up to
  1.5k CPU cores.\n\nTag: Research & ACM SRC Posters\n\nRegistration Catego
 ry: Technical Program Reg Pass\n\nSession Chairs: Kento Sato (RIKEN Center
  for Computational Science (R-CCS)); Chris Schlipalius (Pawsey Supercomput
 ing Research Centre; Commonwealth Scientific and Industrial Research Organ
 isation (CSIRO), Australia); and Anja Gerbes (Georg-August-Universität Göt
 tingen)\n\n
END:VEVENT
END:VCALENDAR