Asymptotically Optimal Load Balancing for Hierarchical Multi-Core Systems

• Main Authors: Pilla, L. L., Navaux, P. O. A., Ribeiro, C. P., Coucheney, P., Broquedis, F., Gaujal, B., Mehaut, J.
• Format: Conference Proceeding
• Language: English
• Subjects: algorithm; Algorithm design and analysis; Benchmark testing; hierarchical architecture; Libraries; load balancing; Load management; multi-core; Multicore processing; performance evaluation; Runtime; Topology
• ISSN: 1521-9097; 2690-5965
• DOI: 10.1109/ICPADS.2012.41

Current multi-core machines feature a complex and hierarchical core topology, multiple levels of cache and memory subsystem with NUMA design. Although this design provides high processing power to parallel machines, it comes with the cost of asymmetric memory access latencies. Depending on the parallel application communication patterns, this asymmetry may reduce the overall performance of the system. Therefore, to achieve scalable performance in this environment, it becomes crucial to exploit the machine architecture while taking into account the application communication patterns. In this paper, we introduce a topology-aware load balancing algorithm named HWTOPOLB. It combines the machine topology characteristics with the communication patterns of the application to equalize the application load on the available cores while reducing latencies. We also present the proof that the algorithm is asymptotically optimal (Theorem 1). We have implemented our load balancing algorithm using the CHARM++ Parallel System and analyzed its performance using three different benchmarks. Our experimental results show that the HWTOPOLB can achieve average performance improvements of 24% when compared to existing load balancing strategies on three different multi-core machines.