Skip to Main content Skip to Navigation
Conference papers

Graph Repartitioning with both Dynamic Load and Dynamic Processor Allocation

Abstract : Dynamic load balancing is an important step conditioning the performance of parallel programs, like adaptive mesh refinement codes. If the global workload varies drastically over time (such that memory is exceeded), it can be relevant to adjust the number of processors while maintaining the load balanced. We propose two different solutions, that extend classic graph repartitioning approaches to accept a variable number of processors: one based on biased partitioning method and one based on a diffusive method. We call this problem: the MxN graph repartitioning problem. Finally, an experimental study on real-life graphs validates our algorithms against state-of-the-art methods.
Complete list of metadata
Contributor : Aurélien Esnard Connect in order to contact the contributor
Submitted on : Wednesday, September 4, 2013 - 10:44:45 AM
Last modification on : Monday, December 20, 2021 - 4:50:14 PM
Long-term archiving on: : Thursday, April 6, 2017 - 3:21:11 PM


Files produced by the author(s)


  • HAL Id : hal-00857881, version 1


Clément Vuchener, Aurélien Esnard. Graph Repartitioning with both Dynamic Load and Dynamic Processor Allocation. International Conference on Parallel Computing - ParCo2013, Sep 2013, München, Germany. ⟨hal-00857881v1⟩



Les métriques sont temporairement indisponibles