Load-Balanced Bottleneck Objectives in Process Mapping

2020/01/27 by Langguth, Johannes, Schlag, Sebastian, Schulz, Christian
#Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)

paper · doi:10.48550/arxiv.2001.09645

Abstract

We propose a new problem formulation for graph partitioning that is tailored to the needs of time-critical simulations on modern heterogeneous supercomputers.

Related

• GPU-Accelerated Algorithms for Process Mapping
• On Dynamic Graph Partitioning and Graph Clustering using Diffusion
• Combinatorial Problems in High-Performance Computing: Partitioning
• High-Quality Hierarchical Process Mapping
• Graph Partitioning with Acyclicity Constraints