Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Schimek, Matthias"'
String sorting is an important part of tasks such as building index data structures. Unfortunately, current string sorting algorithms do not scale to massively parallel distributed-memory machines since they either have latency (at least) proportiona
Externí odkaz:
http://arxiv.org/abs/2404.16517
Autor:
Uhl, Tim Niklas, Schimek, Matthias, Hübner, Lukas, Hespe, Demian, Kurpicz, Florian, Stelz, Christoph, Sanders, Peter
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 interoperability, high-level programming languages like C++ make software deve
Externí odkaz:
http://arxiv.org/abs/2404.05610
Autor:
Sanders, Peter, Schimek, Matthias
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 of Boruvka's algorithm. For partitioned graphs with many local edges, w
Externí odkaz:
http://arxiv.org/abs/2302.12199
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 multi-way merging principle. These algorithms inspect only characters tha
Externí odkaz:
http://arxiv.org/abs/2001.08516