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

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.
Document type :
Conference papers
IEEE Cluster 2013, Sep 2013, Indianapolis, United States. IEEE, 2013
Liste complète des métadonnées


https://hal.inria.fr/hal-00851148
Contributor : François Tessier <>
Submitted on : Monday, August 12, 2013 - 4:19:09 PM
Last modification on : Thursday, September 10, 2015 - 1:06:51 AM
Document(s) archivé(s) le : Wednesday, April 5, 2017 - 8:49:24 PM

File

publi.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00851148, version 1

Collections

Citation

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. IEEE, 2013. <hal-00851148>

Share

Metrics

Record views

445

Document downloads

255