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

Emmanuel Jeannot (1, 2) , Esteban Meneses (3) , Guillaume Mercier (1, 2) , François Tessier (1, 2) , Gengbin Zheng (3)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 RUNTIME - Efficient runtime systems for parallel architectures
3 UIUC - Department of Computer Science [UIUC]

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.

Mots clés: process placement; load balancing; message passing; communication cost

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

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⟩