Load-Balanced Bottleneck Objectives in Process Mapping

01/27/2020
by   Johannes Langguth, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/10/2018

A Polynomial Algorithm for Balanced Clustering via Graph Partitioning

The objective of clustering is to discover natural groups in datasets an...
research
07/22/2021

Load Balanced Semantic Aware Distributed RDF Graph

The modern day semantic applications store data as Resource Description ...
research
11/03/2020

Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters – an Experimental Study

Many problems in scientific and engineering applications contain sparse ...
research
08/25/2021

Towards Informed Partitioning for Load Balancing: a Proof-of-Concept

Most parallel applications suffer from load imbalance, a crucial perform...
research
03/11/1999

A complete anytime algorithm for balanced number partitioning

Given a set of numbers, the balanced partioning problem is to divide the...
research
10/01/2012

Think Locally, Act Globally: Perfectly Balanced Graph Partitioning

We present a novel local improvement scheme for the perfectly balanced g...
research
02/09/2021

Balanced Districting on Grid Graphs with Provable Compactness and Contiguity

Given a graph G = (V,E) with vertex weights w(v) and a desired number of...

Please sign up or login with your details

Forgot password? Click here to reset