Coupling-Aware Graph Partitioning Algorithms: Preliminary Study

Abstract : In the field of scientific computing, load balancing is a major issue that determines the performance of parallel applications. Nowadays, simulations of real-life problems are becoming more and more complex, involving numerous coupled codes, representing different models. In this context, reaching high performance can be a great challenge. In this paper, we present graph partitioning techniques, called co-partitioning, that address the problem of load balancing for two coupled codes: the key idea is to perform a "coupling-aware" partitioning, instead of partitioning these codes independently, as it is usually done. Finally, we present a preliminary experimental study which compares our methods against the usual approach.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-01069578
Contributor : Aurélien Esnard <>
Submitted on : Monday, September 29, 2014 - 2:17:28 PM
Last modification on : Thursday, January 11, 2018 - 6:22:35 AM
Long-term archiving on: Tuesday, December 30, 2014 - 11:21:07 AM

File

hipc-final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Maria Predari, Aurélien Esnard. Coupling-Aware Graph Partitioning Algorithms: Preliminary Study. IEEE International Conference on High Performance Computing (HiPC 2014), Dec 2014, Goa, India. ⟨10.1109/HiPC.2014.7116879⟩. ⟨hal-01069578⟩

Share

Metrics

Record views

321

Files downloads

332