BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T000712Z
LOCATION:301-302-303
DTSTART;TZID=America/Denver:20231116T140000
DTEND;TZID=America/Denver:20231116T143000
UID:submissions.supercomputing.org_SC23_sess156_pap489@linklings.com
SUMMARY:A High-Performance MST Implementation for GPUs
DESCRIPTION:Alex Fallin, Andres Gonzalez, Jarim Seo, and Martin Burtscher 
 (Texas State University)\n\nFinding a minimum spanning tree (MST) is a fun
 damental graph algorithm with applications in many fields. This paper pres
 ents ECL-MST, a fast MST implementation designed specifically for GPUs. EC
 L-MST is based on a parallelization approach that unifies Kruskal's and Bo
 růvka's algorithm and incorporates new and existing optimizations from the
  literature, including implicit path compression and edge-centric operatio
 n. On two test systems, it outperforms leading GPU and CPU codes from the 
 literature on all of our 17 input graphs from various domains. On a Titan 
 V GPU, ECL-MST is, on average, 4.6 times faster than the next fastest code
 , and on an RTX 3080 Ti GPU, it is 4.5 times faster. On both systems, ECL-
 MST running on the GPU is roughly 30 times faster than the fastest paralle
 l CPU code.\n\nTag: Accelerators, Algorithms, Graph Algorithms and Framewo
 rks\n\nRegistration Category: Tech Program Reg Pass\n\nReproducibility Bad
 ges: Artifact Available, Artifact Functional, Results Reproduced\n\nSessio
 n Chair: Alessio Sclocco (Netherlands eScience Center)\n\n
END:VEVENT
END:VCALENDAR