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:20260422T000711Z
LOCATION:401-402
DTSTART;TZID=America/Denver:20231117T090000
DTEND;TZID=America/Denver:20231117T093000
UID:submissions.supercomputing.org_SC23_sess460_misc341@linklings.com
SUMMARY:Dynamic Data Structures on the GPU
DESCRIPTION:John Owens (University of California, Davis)\n\nIf I had to su
 m up the purpose of data structures in three words, I'd say they "organize
  sparse data". And as we know, the future is sparse. Dynamic data structur
 es allow updates to data structures without having to rebuild them complet
 ely. In my talk, I'll discuss recent progress in designing and implementin
 g dynamic data structures for GPUs, whose implementations present signific
 ant challenges. I'll talk briefly about work in log-structured merge trees
 , quotient filters, linked lists, hash tables, dynamic graphs, and B-trees
 , but mostly about principles that we followed in building them and what w
 e learned from the experience.\n\nTag: Graph Algorithms and Frameworks, Li
 near Algebra, Programming Frameworks and System Software, State of the Pra
 ctice\n\nRegistration Category: Workshop Reg Pass\n\nSession Chairs: Xing 
 Cai (University of Oslo, Norway; Simula Research Laboratory/University of 
 Oslo); Aleksandar Ilic (INESC-ID, IST, University of Lisbon; University of
  Lisbon, Portugal); Kamer Kaya (Sabancı University, Turkey); and Didem Una
 t (Koç University, Turkey)\n\n
END:VEVENT
END:VCALENDAR