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:20260422T143138Z
LOCATION:B309
DTSTART;TZID=America/New_York:20241120T110000
DTEND;TZID=America/New_York:20241120T113000
UID:submissions.supercomputing.org_SC24_sess402_pap386@linklings.com
SUMMARY:KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI
DESCRIPTION:Tim Niklas Uhl and Matthias Schimek (Karlsruhe Institute of Te
 chnology (KIT)); Lukas Hübner (Karlsruhe Institute of Technology (KIT), He
 idelberg Institute of Theoretical Studies); Demian Hespe (Independent); an
 d Florian Kurpicz, Daniel Seemaier, Christoph Stelz, and Peter Sanders (Ka
 rlsruhe Institute of Technology (KIT))\n\nThe Message-Passing Interface (M
 PI) and C++ form the backbone of high-performance computing, but MPI only 
 provides C and Fortran bindings.\nWhile this offers great language interop
 erability, high-level programming languages like C++ make software develop
 ment quicker and less error-prone.\n\nWe propose novel C++ language bindin
 gs that cover all abstraction levels from low-level MPI calls to convenien
 t STL-style bindings, where most parameters are inferred from a small subs
 et of parameters, by bringing named parameters to C++.\nThis enables rapid
  prototyping and fine-tuning runtime behavior and memory management.\nA fl
 exible type system and additional safety guarantees help to prevent progra
 mming errors.\n\nBy exploiting C++'s template metaprogramming capabilities
 , this has (near) zero overhead, as only required code paths are generated
  at compile time.\n\nWe demonstrate that our library is a strong foundatio
 n for a future distributed standard library using multiple application ben
 chmarks, ranging from text-book sorting algorithms to phylogenetic interfe
 rence.\n\nTag: Distributed Computing, Heterogeneous Computing, Programming
  Frameworks and System Software, Runtime Systems, Task Parallelism\n\nRegi
 stration Category: Tech Program Reg Pass\n\nAward Finalist: Best Paper Fin
 alist\n\nSession Chair: Claudia Fohry (University of Kassel, Germany)\n\n
END:VEVENT
END:VCALENDAR