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:20260422T000625Z
LOCATION:301-302-303
DTSTART;TZID=America/Denver:20231116T133000
DTEND;TZID=America/Denver:20231116T150000
UID:submissions.supercomputing.org_SC23_sess156@linklings.com
SUMMARY:Algorithms on GPUs
DESCRIPTION:Adaptive Workload-Balanced Scheduling Strategy for Global Ocea
 n Data Assimilation on Massive GPUs\n\nGlobal ocean data assimilation is a
  crucial technique to estimate the actual oceanic state by combining numer
 ical model outcomes and observation data, which is widely used in climate 
 research. Due to the imbalanced distribution of observation data in global
  ocean, the parallel efficiency of recent m...\n\n\nJunmin Xiao (Institute
  of Computing Technology, Chinese Academy of Sciences); Chaoyang Shui (Ins
 titute of Computing Technology, Institute of Computing Technology, Chinese
  Academy of Sciences); and Di Cai, Kangyu Wang, Yunfei Pang, Mingyi Li, Hu
 i Ma, and Guangming Tan (Institute of Computing Technology, Chinese Academ
 y of Sciences)\n---------------------\nParallel Top-K Algorithms on GPU: A
  Comprehensive Study and New Methods\n\nThe top-K problem is an essential 
 part of many important applications in scientific computing, information r
 etrieval, etc. As data volume grows rapidly, high-performance parallel top
 -K algorithms become critical. We propose two parallel top-K algorithms, A
 IR top-K (Adaptive and Iteration-fused Radix...\n\n\nJingrong Zhang, Akira
  Naruse, Xipeng Li, and Yong Wang (NVIDIA Corporation)\n------------------
 ---\nA High-Performance MST Implementation for GPUs\n\nFinding a minimum s
 panning tree (MST) is a fundamental graph algorithm with applications in m
 any fields. This paper presents ECL-MST, a fast MST implementation designe
 d specifically for GPUs. ECL-MST is based on a parallelization approach th
 at unifies Kruskal's and Borůvka's algorithm and incor...\n\n\nAlex Fallin
 , Andres Gonzalez, Jarim Seo, and Martin Burtscher (Texas State University
 )\n\nTag: Accelerators, Algorithms, Graph Algorithms and Frameworks\n\nReg
 istration Category: Tech Program Reg Pass\n\nReproducibility Badges: Artif
 act Available, Artifact Functional, Results Reproduced\n\nSession Chair: A
 lessio Sclocco (Netherlands eScience Center)
END:VEVENT
END:VCALENDAR