Load Balancing White Papers
A Repartitioning Hypergraph Model for Dynamic Load Balancing
Overview In parallel adaptive applications, the computational structure of the applications changes over time, leading to load imbalances even though the initial load distributions were balanced. To restore balance and to keep communication volume low in further iterations of the applications, dynamic load balancing (repartitioning) of the changed computational structure is required. Repartitioning differs from static load balancing (partitioning) due to the additional requirement of minimizing migration cost to move data from an existing partition to a new partition. This paper presents a novel repartitioning hypergraph model for dynamic load balancing that accounts for both communication volume in the application and migration cost to move data, in order to minimize the overall cost.
| Publisher | Ohio State University | File Format | |
|---|---|---|---|
| Date Published | April 2008 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 1 out of 3 users found this white paper useful
White Paper RSS
Download
Register
