1 citations · 2 across the 4 of their papers we have counts for
5 papers
Topology-induced Enhancement of Mappings
Roland Glantz, Maria Predari, Henning Meyerhenke
In this paper we propose a new method to enhance a mapping of a parallel application's computational tasks to the processing elements (PEs) of a parallel computer. The i…
Many-to-many Correspondences between Partitions: Introducing a Cut-based Approach
Roland Glantz, Henning Meyerhenke
Let and be finite partitions of the set . Finding good correspondences between the parts of and those of is helpful in…
Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures
Roland Glantz, Henning Meyerhenke, Alexander Noe
Static mapping is the assignment of parallel processes to the processing elements (PEs) of a parallel system, where the assignment does not change during the application's lifetime…
Tree-based Coarsening and Partitioning of Complex Networks
Roland Glantz, Henning Meyerhenke, Christian Schulz
Many applications produce massive complex networks whose analysis would benefit from parallel processing. Parallel algorithms, in turn, often require a suitable network partition.…
Finding all Convex Cuts of a Plane Graph in Polynomial Time
Roland Glantz, Henning Meyerhenke
Convexity is a notion that has been defined for subsets of $\RR^n$ and for subsets of general graphs. A convex cut of a graph is a -partition s…