UMPa: A Multi-objective, multi-level partitioner for communication minimization - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Chapitre D'ouvrage Année : 2013

UMPa: A Multi-objective, multi-level partitioner for communication minimization

Résumé

We propose a directed hypergraph model and a refinement heuristic to distribute communicating tasks among the processing units in a distributed memory setting. The aim is to achieve load balance and minimize the maximum data sent by a processing unit. We also take two other communication metrics into account with a tie-breaking scheme. With this approach, task distributions causing an excessive use of network or a bottleneck processor which participates to almost all of the communication are avoided. We show on a large number of problem instances that our model improves the maximum data sent by a processor up to 34% for parallel environments with 4, 16, 64 and 256 processing units compared to the state of the art which only minimizes the total communication volume.
Fichier principal
Vignette du fichier
umpa-dimacs.pdf (398.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00763563 , version 1 (19-12-2019)

Identifiants

Citer

Umit V. Catalyurek, Mehmet Deveci, Kamer Kaya, Bora Uçar. UMPa: A Multi-objective, multi-level partitioner for communication minimization. David A. Bader; Henning Meyerhenke; Peters Sanders; Dorothea Wagner. Graph Partitioning and Graph Clustering 2012, 588, AMS, pp.53--66, 2013, Contemporary Mathematics, ⟨10.1090/conm/588/11704⟩. ⟨hal-00763563⟩
191 Consultations
154 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More