157 citations · 421 across the 63 of their papers we have counts for
11 papers · 1 filter
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures
Maria Predari, Charilaos Tzovas, Christian Schulz +1
Processing massive application graphs on distributed memory systems requires to map the graphs onto the system's processing elements (PEs). This task becomes all the more important…
The Future is Big Graphs! A Community View on Graph Processing Systems
Sherif Sakr, Angela Bonifati, Hannes Voigt +38
Graphs are by nature unifying abstractions that can leverage interconnectedness to represent, explore, predict, and explain real- and digital-world phenomena. Although real users a…
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…
Load-Balanced Bottleneck Objectives in Process Mapping
Johannes Langguth, Sebastian Schlag, Christian Schulz
We propose a new problem formulation for graph partitioning that is tailored to the needs of time-critical simulations on modern heterogeneous supercomputers.
Communication-free Massively Distributed Graph Generation
Daniel Funke, Sebastian Lamm, Ulrich Meyer +5
Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do so is a challenging task that requires a careful analysis…
VieM v1.00 -- Vienna Mapping and Sparse Quadratic Assignment User Guide
Christian Schulz, Jesper Larsson Träff
This paper severs as a user guide to the mapping framework VieM (Vienna Mapping and Sparse Quadratic Assignment). We give a rough overview of the techniques used within the framewo…