A Dynamic Load Balancing Approach with SMPSuperscalar and MPI
In this paper we are going to compare the performance obtained with the hybrid programming models MPI+SMPSs and MPI+OpenMP, especially when executing with a Dynamic Load Balancing (DLB) library. But first we will describe the SMPSuperscalar programming model and how it hybridizes nicely with MPI. We are also explaining the load balancing algorithm for hybrid applications, LeWI, and how it can improve the performance of hybrid applications. We will also analyze why SMPSs is able to exploit the benefits of LeWI further than OpenMP. The performance results will show not only how the performance of hybrid applications can be improved with LeWI but also the benefit of using a hybrid programming model MPI+SMPSs for load balancing instead of MPI+OpenMP.
KeywordsTask Graph Parallel Region Dynamic Load Balance Shared Memory System Work Thread
Unable to display preview. Download preview PDF.
- 1.Henty, D.S.: Performance of hybrid message-passing and shared-memory parallelism for discrete element modeling. In: Proceedings of the 2000 ACM/IEEE Conference on Supercomputing (2000)Google Scholar
- 2.Garcia, M., Corbalan, J., Labarta, J.: LeWI: A runtime balancing algorithm for nested parallelism. In: International Conference on Parallel Processing, ICPP 2009 (2009)Google Scholar
- 3.Perez, J.M., Badia, R.M., Labarta, J.: A dependency-aware task-based programming environment for multi-core architectures. In: 2008 IEEE International Conference on Cluster Computing (2008)Google Scholar
- 4.SMPSuperscalar official site and documentation, http://www.bsc.es/smpsuperscalar
- 5.Van der Wijngaart, R., Jin, H.: NAS parallel benchmarks, multi-zone versions. Technical report, NAS Technical Report NAS-03-010, NASA Ames Research Center, Moffett Field, CA (2003)Google Scholar