Coupling-Aware Graph Partitioning Algorithms: Preliminary Study - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Coupling-Aware Graph Partitioning Algorithms: Preliminary Study


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.
Fichier principal
Vignette du fichier
hipc-final.pdf (698.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01069578 , version 1 (29-09-2014)



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⟩
157 View
270 Download



Gmail Facebook X LinkedIn More