Cache size in a cost model for heterogeneous skeletons

Armih, K., Trinder, P.W. and Michaelson, G.J. (2011) Cache size in a cost model for heterogeneous skeletons. In: Fifth International Workshop on High-level Parallel Programming and Applications (HLPP 2011), Tokyo, Japan, 18 Sep 2011,

Full text not currently available from Enlighten.


High performance architectures are increasingly heterogeneous with shared and distributed memory components. Programming such architectures is complicated and performance portability is a major issue as the architectures evolve. This paper proposes a new architectural cost model that accounts for cache size and improves on heterogeneous architectures, and demonstrates a skeleton-based programming model that simplifies programming heterogeneous architectures. We further demonstrate that the cost model can be exploited by skeletons to improve load balancing on heterogeneous architectures. The heterogeneous skeleton model facilitates performance portability, using the architectural cost model to automatically balance load across heterogeneous components of the architecture. For both a data parallel benchmark, and realistic image processing program we obtain good performance for the heterogeneous skeleton on homogeneous shared and distributed memory architectures, and on three heterogeneous architectures. We also show that taking cache size into account in the model leads to improved balance and performance.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Trinder, Professor Phil
Authors: Armih, K., Trinder, P.W., and Michaelson, G.J.
College/School:College of Science and Engineering > School of Computing Science

University Staff: Request a correction | Enlighten Editors: Update this record