10 citations · 12 across the 4 of their papers we have counts for
6 papers · 1 filter
Engineering Scalable Distributed List Ranking
Peter Sanders, Matthias Schimek, Tim Niklas Uhl +1
The list ranking problem is one of the classical problems of parallel computing, with nontrivial algorithms and many applications as a subroutine for solving other problems. While…
Concepts in Practice: C++ MPI Bindings for the HPC Ecosystem - From a Standardizable Core to a Composable Interface
Tim Niklas Uhl, Matthias Schimek, Daniel Brommer
The official C++ MPI bindings were removed from the standard in 2008, leaving a gap that numerous third-party libraries have attempted to fill. However, existing wrappers typically…
Concepts for designing modern C++ interfaces for MPI
C. Nicole Avans, Alfredo A. Correa, Sayan Ghosh +5
Since the C++ bindings were deleted in 2008, the Message Passing Interface (MPI) community has revived efforts in building high-level modern C++ interfaces. Such interfaces are eit…
KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI
Tim Niklas Uhl, Matthias Schimek, Lukas Hübner +4
The Message-Passing Interface (MPI) and C++ form the backbone of high-performance computing, but MPI only provides C and Fortran bindings. While this offers great language interope…
Engineering Massively Parallel MST Algorithms
Peter Sanders, Matthias Schimek
We develop and extensively evaluate highly scalable distributed-memory algorithms for computing minimum spanning trees (MSTs). At the heart of our solutions is a scalable variant o…
Communication-Efficient String Sorting
Timo Bingmann, Peter Sanders, Matthias Schimek
There has been surprisingly little work on algorithms for sorting strings on distributed-memory parallel machines. We develop efficient algorithms for this problem based on the mul…