BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T143054Z
LOCATION:B309
DTSTART;TZID=America/New_York:20241120T103000
DTEND;TZID=America/New_York:20241120T120000
UID:submissions.supercomputing.org_SC24_sess402@linklings.com
SUMMARY:Parallel Programming Frameworks, Libraries and Runtimes
DESCRIPTION:KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MP
 I\n\nThe Message-Passing Interface (MPI) and C++ form the backbone of high
 -performance computing, but MPI only provides C and Fortran bindings.\nWhi
 le this offers great language interoperability, high-level programming lan
 guages like C++ make software development quicker and less error-prone.\n\
 nWe propose ...\n\n\nTim Niklas Uhl and Matthias Schimek (Karlsruhe Instit
 ute of Technology (KIT)); Lukas Hübner (Karlsruhe Institute of Technology 
 (KIT), Heidelberg Institute of Theoretical Studies); Demian Hespe (Indepen
 dent); and Florian Kurpicz, Daniel Seemaier, Christoph Stelz, and Peter Sa
 nders (Karlsruhe Institute of Technology (KIT))\n---------------------\nCU
 DASTF: Bridging the Gap Between CUDA and Task Parallelism\n\nOrganizing co
 mputation as asynchronous tasks with data-driven dependencies is a simple 
 and efficient model for single-and-multi-GPU programs. Sequential Task Flo
 w (STF) is such a model, which derives task graphs from data dependencies.
 \nWe propose CUDASTF, a C++ library that implements STF over CUDA ...\n\n\
 nCedric Augonnet, Andrei Alexandrescu, Albert Sidelnik, and Michael Garlan
 d (NVIDIA Corporation)\n---------------------\nNetCL: A Unified Programmin
 g Framework for In-Network Computing\n\nThe emergence of programmable data
  planes (PDPs) has paved the way for in-network computing (INC), a paradig
 m wherein networking devices actively participate in distributed computati
 ons. However, PDPs are still a niche technology, mostly available to netwo
 rk operators, and rely on packet-processing ...\n\n\nGeorge Karlos and Hen
 ri Bal (Vrije Universiteit Amsterdam) and Lin Wang (Paderborn University, 
 Germany)\n\nTag: Distributed Computing, Heterogeneous Computing, Programmi
 ng Frameworks and System Software, Runtime Systems, Task Parallelism\n\nRe
 gistration Category: Tech Program Reg Pass\n\nAward Finalist: Best Paper F
 inalist\n\nSession Chair: Claudia Fohry (University of Kassel, Germany)
END:VEVENT
END:VCALENDAR