Performance portability on EARTH: a case study across several parallel architectures

2007 ◽  
Vol 10 (2) ◽  
pp. 115-126 ◽  
Author(s):  
Weirong Zhu ◽  
Yanwei Niu ◽  
Guang R. Gao
Author(s):  
Rahulkumar Gayatri ◽  
Charlene Yang ◽  
Thorsten Kurth ◽  
Jack Deslippe

2003 ◽  
Vol 13 (03) ◽  
pp. 461-472 ◽  
Author(s):  
HOLGER BISCHOF ◽  
SERGEI GORLATCH ◽  
ROMAN LESHCHINSKIY

The concept of C++ templates, realized in the Standard Template Library (STL), allows development of generic programs suitable for various concrete data structures. Our aim in this paper is to provide an opportunity for efficient execution of STL programs on parallel machines. We present DatTeL – a data-parallel library, which allows simple, efficient programming for various parallel architectures while staying within the paradigm of classical C++ template programming. We describe the principles of our approach and explain our design decisions and their implementation in the library. The presentation is illustrated with a case study — parallelization of a generic algorithm for carry-lookahead addition. We compare DatTeL to related work and report experimental results for the current version of our library.


Ab initio computations can be used to determine the values of a wide variety of physical properties of atoms, molecules and solids. The calculations are com­- putationally demanding and can only be applied to small systems. One possible method for overcoming this limitation is to use parallel computers which, in principle, can provide unlimited computational power. In this paper the technical difficulties associated with parallelizing ab initio calculations are reviewed and a case study detailing the implementation of total energy pseudopotential codes on parallel machines is presented.


2001 ◽  
Vol 11 (04) ◽  
pp. 393-407 ◽  
Author(s):  
ANDREA ZAVANELLA

The Skeletal approach to parallel programming conjugates a high-level compositional style and efficiency. A second advantage of Skeletal programming is portability since implementation decisions are usually taken at compile time. The paper claims that an intermediate model embedding the main performance features of the target architecture facilitates performance portability across parallel architectures. This is motivated by describing the Skel-BSP framework which implements a skeleton system on top of a BSP computer. A prototype compiler based on a set of BSP templates is presented together with a set of performance models for each skeleton which allow a local optimization. The paper also introduces a global optimization strategy using a set of transformation rules. This local+global approach seems a viable solution to writing parallel software in machine-independent way (Writing Once and Compiling Everywhere).


Sign in / Sign up

Export Citation Format

Share Document