Exploring Traditional and Emerging Parallel Programming Models using a Proxy Application

Ian Karlin, Abhinav Bhatele, Jeff Keasler, Bradford L. Chamberlain, Jonathan Cohen, Zachary DeVito, Riyaz Haque, Dan Laney, Edward Luke, Felix Wang, David Richards, Martin Schulz, Charles H. Still
Lawrence Livermore National Laboratory, P. O. Box 808, Livermore, California 94551 USA
IEEE International Parallel & Distributed Processing Symposium (IPDPS ’13), 2013


   title={Exploring Traditional and Emerging Parallel Programming Models using a Proxy Application},

   author={Karlin, I. and Bhatele, A. and Keasler, J. and Chamberlain, B.L. and Cohen, J. and DeVito, Z. and Haque, R. and Laney, D. and Luke, E. and Wang, F. and others},



Download Download (PDF)   View View   Source Source   



Parallel computing architectures are becoming more complex with increasing core counts and more heterogeneous architectures. However, the most commonly used programming models, C/C++ with MPI and/or OpenMP, make it very difficult to write source code that is easily tuned for many targets. Newer language approaches attempt to ease this burden by providing optimization features such as computation and communication overlap, message-driven execution, automatic load balancing and implicit data layout optimizations. In this paper, we compare multiple implementations of LULESH, a proxy application for a shock hydrodynamics, to determine strengths and weaknesses of four traditional (OpenMP, MPI, MPI+OpenMP, CUDA) and four emerging (Chapel, Charm++, Liszt, Loci) programming models for parallel computation. In evaluating these programming models, we focus on programmer productivity, performance and ease of applying optimizations.
Rating: 2.0/5. From 4 votes.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: