7299

Performance analysis and optimization of the OP2 framework on many-core architectures

M.B. Giles, G.R. Mudalige, Z. Sharif, G. Markall, P.H.J. Kelly
Oxford e-Research Centre, University of Oxford, Oxford, UK
The Computer Journal, Volume 55 Issue 2, 2012

@article{giles2012performance,

   title={Performance analysis and optimization of the OP2 framework on many-core architectures},

   author={Giles, MB and Mudalige, GR and Sharif, Z. and Markall, G. and Kelly, PHJ},

   journal={The Computer Journal},

   volume={55},

   number={2},

   pages={168–180},

   year={2012},

   publisher={Br Computer Soc}

}

Download Download (PDF)   View View   Source Source   Source codes Source codes

Package:

723

views

This paper presents a benchmarking, performance analysis and optimization study of the OP2 ‘active’ library, which provides an abstraction framework for the parallel execution of unstructured mesh applications. OP2 aims to decouple the scientific specification of the application from its parallel implementation, and thereby achieve code longevity and near-optimal performance through re-targeting the application to execute on different multi-core/many-core hardware. Runtime performance results are presented for a representative unstructured mesh application on a variety of many-core processor systems, including traditional X86 architectures from Intel (Xeon based on the older Penryn and current Nehalem micro-architectures) and GPU offerings from NVIDIA (GTX260, Tesla C2050). Our analysis demonstrates the contrasting performance between the use of CPU (OpenMP) and GPU (CUDA) parallel implementations for the solution of an industrial-sized unstructured mesh consisting of about 1.5A million edges. Results show the significance of choosing the correct partition and thread-block configuration, the factors limiting the GPU performance and insights into optimizations for improved performance.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: