14 citations · 31 across the 5 of their papers we have counts for
6 papers
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 a Distributed-Memory Triangle Counting Algorithm
Peter Sanders, Tim Niklas Uhl
Counting triangles in a graph and incident to each vertex is a fundamental and frequently considered task of graph analysis. We consider how to efficiently do this for huge graphs…
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies
Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl +1
Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on co…