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:20260422T000626Z
LOCATION:405-406-407
DTSTART;TZID=America/Denver:20231114T153000
DTEND;TZID=America/Denver:20231114T170000
UID:submissions.supercomputing.org_SC23_sess173@linklings.com
SUMMARY:High Performance for Graph Operations
DESCRIPTION:GraphSet: High Performance Graph Mining through Equivalent Set
  Transformations\n\nGraph mining is of critical use in a number of fields 
 such as social networks, knowledge graphs, and fraud detection. As an NP-c
 omplete problem, improving computation performance is the main target for 
 current optimizations. Due to excellent performance, state-of-the-art grap
 h mining systems mainly ...\n\n\nTianhui Shi, Jidong Zhai, Haojie Wang, Qi
 qian Chen, Mingshu Zhai, Zixu Hao, Haoyu Yang, and Wenguang Chen (Tsinghua
  University, China)\n---------------------\nSpace Efficient Sequence Align
 ment for SRAM-Based Computing: X-Drop on the Graphcore IPU\n\nDedicated ac
 celerator hardware has become essential for processing AI-based workloads,
  leading to the rise of novel accelerator architectures.  Furthermore, fun
 damental differences in memory architecture and parallelism have made thes
 e accelerators targets for scientific computing.  The sequence ali...\n\n\
 nLuk Burchard (Simula Research Laboratory); Max Xiaohang Zhao (Charité Uni
 versitätsmedizin Berlin); Johannes Langguth (Simula Research Laboratory, U
 niversity of Bergen); Aydın Buluç (Lawrence Berkeley National Laboratory (
 LBNL)); and Giulia Guidi (Cornell University)\n---------------------\nBrin
 ging Order to Sparsity: A Sparse Matrix Reordering Study on Multicore CPUs
 \n\nMany real-world computations involve sparse data structures in the for
 m of sparse matrices. A common strategy for optimizing sparse matrix opera
 tions is to reorder a matrix to improve data locality. However, it's not a
 lways clear whether reordering will provide benefits over the unordered ma
 trix, as...\n\n\nJames D. Trotter (Simula Research Laboratory); Sinan Ekme
 kçibaşı (Istanbul University - Cerrahpaşa); Johannes Langguth (Simula Rese
 arch Laboratory; University of Bergen, Norway); Tugba Torun and Emre Düzak
 ın (Koç University, Turkey); Aleksandar Ilic (INESC-ID, IST, University of
  Lisbon); and Didem Unat (Koç University, Turkey)\n\nTag: Accelerators, Ap
 plications, Graph Algorithms and Frameworks, Performance Measurement, Mode
 ling, and Tools, Programming Frameworks and System Software\n\nRegistratio
 n Category: Tech Program Reg Pass\n\nReproducibility Badges: Artifact Avai
 lable, Artifact Functional, Results Reproduced\n\nSession Chair: Mehmet E 
 Belviranli (Colorado School of Mines)
END:VEVENT
END:VCALENDAR