Communication and Topology-aware Load Balancing in Charm++ with TreeMatch - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Communication and Topology-aware Load Balancing in Charm++ with TreeMatch

(1, 2) , (3) , (1, 2) , (1, 2) , (3)
1
2
3

Abstract

Programming multicore or manycore architectures is a hard challenge particularly if one wants to fully take advantage of their computing power. Moreover, a hierarchical topology implies that communication performance is heterogeneous and this characteristic should also be exploited. We developed two load balancers for Charm++ that take into account both aspects, depending on the fact that the application is compute-bound or communication-bound. This work is based on our TREEMATCH library that computes process placement in order to reduce an application communication costs based on the hardware topology. We show that the proposed load-balancing schemes manage to improve the execution times for the two aforementioned classes of parallel applications.
Fichier principal
Vignette du fichier
publi.pdf (439.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00851148 , version 1 (12-08-2013)

Identifiers

  • HAL Id : hal-00851148 , version 1

Cite

Emmanuel Jeannot, Esteban Meneses, Guillaume Mercier, François Tessier, Gengbin Zheng. Communication and Topology-aware Load Balancing in Charm++ with TreeMatch. IEEE Cluster 2013, Sep 2013, Indianapolis, United States. ⟨hal-00851148⟩
341 View
338 Download

Share

Gmail Facebook Twitter LinkedIn More