4 papers
Theory Meets Practice for Bit Vectors Supporting Rank and Select
Florian Kurpicz, Niccolò Rigi-Luperti, Peter Sanders
Bit vectors with support for fast rank and select are a fundamental building block for compressed data structures. We close a gap between theory and practice by analyzing an import…
Fast and Lightweight Distributed Suffix Array Construction -- First Results
Manuel Haag, Florian Kurpicz, Peter Sanders +1
We present first algorithmic ideas for a practical and lightweight adaption of the DCX suffix array construction algorithm [Sanders et al., 2003] to the distributed-memory setting.…
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…
Tera-Scale Multilevel Graph Partitioning
Daniel Salwasser, Daniel Seemaier, Lars Gottesbüren +1
We present TeraPart, a memory-efficient multilevel graph partitioning method that is designed to scale to extremely large graphs. In balanced graph partitioning, the goal is to div…