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:20260422T000604Z
LOCATION:DEF Concourse
DTSTART;TZID=America/Denver:20231115T100000
DTEND;TZID=America/Denver:20231115T170000
UID:submissions.supercomputing.org_SC23_sess303_rpost106@linklings.com
SUMMARY:ParLeiden: Boosting Parallelism of Distributed Leiden Algorithm on
  Large-Scale Graphs
DESCRIPTION:Yongmin Hu (Douyin Vision Co., Ltd); Jing Wang (Shanghai Jiao 
 Tong University); Cheng Zhao (Douyin Vision Co., Ltd); Yibo Liu (Shanghai 
 Jiao Tong University); Cheng Chen and Xiaoliang Cong (Douyin Vision Co., L
 td); and Chao Li (Shanghai Jiao Tong University)\n\nLeiden algorithm has d
 emonstrated superior efficacy compared to traditional Louvain algorithms i
 n the field of community detection. However, parallelizing the Leiden algo
 rithm while imposing community size limitations brings significant challen
 ges in big data processing scenarios. We present ParLeiden, a pioneering p
 arallel Leiden strategy designed for distributed environments. By thread l
 ocks and efficient buffers, we effectively resolve community joining confl
 icts and reduce communication overheads.  We can run Leiden algorithm on l
 arge-scale graphs and achieve performance speedup on up to 9.8 times than 
 baselines.\n\nTag: Artificial Intelligence/Machine Learning, Architecture 
 and Networks, Heterogeneous Computing, I/O and File Systems, Performance M
 easurement, Modeling, and Tools, Post-Moore Computing, Programming Framewo
 rks and System Software, Quantum Computing\n\nRegistration Category: Tech 
 Program Reg Pass, Exhibits Reg Pass\n\n
END:VEVENT
END:VCALENDAR