16 citations · 54 across the 10 of their papers we have counts for
10 papers
pSTL-Bench: A Micro-Benchmark Suite for Assessing Scalability of C++ Parallel STL Implementations
Ruben Laso, Diego Krupitza, Sascha Hunold
Since the advent of parallel algorithms in the C++17 Standard Template Library (STL), the STL has become a viable framework for creating performance-portable applications. Given mu…
Efficient Process-to-Node Mapping Algorithms for Stencil Computations
Sascha Hunold, Konrad von Kirchbach, Markus Lehr +2
Good process-to-compute-node mappings can be decisive for well performing HPC applications. A special, important class of process-to-node mapping problems is the problem of mapping…
Scheduling.jl -- Collaborative and Reproducible Scheduling Research with Julia
Sascha Hunold, Bartłomiej Przybylski
We introduce the Scheduling.jl Julia package, which is intended for collaboratively conducting scheduling research and for sharing implementations of algorithms. It provides the fu…
Tuning MPI Collectives by Verifying Performance Guidelines
Sascha Hunold, Alexandra Carpen-Amarie
MPI collective operations provide a standardized interface for performing data movements within a group of processes. The efficiency of collective communication operations depends…
MPI Derived Datatypes: Performance Expectations and Status Quo
Alexandra Carpen-Amarie, Sascha Hunold, Jesper Larsson Träff
We examine natural expectations on communication performance using MPI derived datatypes in comparison to the baseline, "raw" performance of communicating simple, non-contiguous da…
Message-Combining Algorithms for Isomorphic, Sparse Collective Communication
Jesper Larsson Träff, Alexandra Carpen-Amarie, Sascha Hunold +1
Isomorphic (sparse) collective communication is a form of collective communication in which all involved processes communicate in small, identically structured neighborhoods of oth…