KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI

TN Uhl, M Schimek, L Hübner, D Hespe… - … Conference for High …, 2024 - ieeexplore.ieee.org
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 …

Kam**: Flexible and (near) zero-overhead c++ bindings for mpi

TN Uhl, M Schimek, L Hübner, D Hespe… - arxiv preprint arxiv …, 2024 - arxiv.org
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 …

SACABench: Benchmarking suffix array construction

J Bahne, N Bertram, M Böcker, J Bode… - String Processing and …, 2019 - Springer
We present a practical comparison of suffix array construction algorithms on modern
hardware. The benchmark is conducted using our new benchmark framework SACABench …

Fast and Lightweight Distributed Suffix Array Construction--First Results

M Haag, F Kurpicz, P Sanders, M Schimek - arxiv preprint arxiv …, 2024 - arxiv.org
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. Our …

Constructing the wavelet tree and wavelet matrix in distributed memory

P Dinklage, J Fischer, F Kurpicz - 2020 Proceedings of the Twenty-Second …, 2020 - SIAM
The wavelet tree (Grossi et al.[SODA, 2003]) is a compact index for texts that provides rank,
select, and access operations. This leads to many applications in text indexing …

[PDF][PDF] Scalable Text Index Construction

T Bingmann, P Dinklage, J Fischer… - Algorithms for Big …, 2023 - library.oapen.org
Scalable Text Index Construction Page 263 Scalable Text Index Construction Timo Bingmann1,
Patrick Dinklage2, Johannes Fischer2, Florian Kurpicz2 (B), Enno Ohlebusch3, and Peter …

[PDF][PDF] Parallel text index construction

F Kurpicz - 2020 - d-nb.info
The focus of this dissertation is the parallel construction of text indices. Text indices provide
additional information about a text that allow to answer queries faster. Fulltext indices for …