4 citations · 14 across the 15 of their papers we have counts for
8 papers · 1 filter
Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs
Alexander van der Grinten, Geert Custers, Duy Le Thanh +1
Sparse matrix multiplication (SpGEMM) is a fundamental kernel used in many diverse application areas, both numerical and discrete. For example, many algebraic graph algorithms rely…
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…
Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters -- an Experimental Study
Charilaos Tzovas, Maria Predari, Henning Meyerhenke
Many problems in scientific and engineering applications contain sparse matrices or graphs as main input objects, e.g. numerical simulations on meshes. Large inputs are abundant th…
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling
Alexander van der Grinten, Henning Meyerhenke
Betweenness centrality is one of the most popular vertex centrality measures in network analysis. Hence, many (sequential and parallel) algorithms to compute or approximate between…
Parallel Adaptive Sampling with almost no Synchronization
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
Approximation via sampling is a widespread technique whenever exact solutions are too expensive. In this paper, we present techniques for an efficient parallelization of adaptive (…
Balanced k-means for Parallel Geometric Partitioning
Moritz von Looz, Charilaos Tzovas, Henning Meyerhenke
Mesh partitioning is an indispensable tool for efficient parallel numerical simulations. Its goal is to minimize communication between the processes of a simulation while achieving…