Skel-BSP: Performance Portability for Skeletal Programming

  • Authors:
  • Andrea Zavanella

  • Affiliations:
  • -

  • Venue:
  • HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Skel-BSP methodology provides an adaptive support for skeleton programs aiming to achieve performance portability for parallel programming. The adaptivity is obtained by choosing templates and implementation parameters according to the target machine characteristics. Each choice is made using an optimization theorem demonstrated using EdD-BSP cost predictions. The work presents several strategies to optimize the pure data parallel subset of Skel-BSP. Data parallel programs can be written in Skel-BSP combining map, reduce and scan skeletons. Analogous results have been already derived for the stream parallel subset of the language (pipe, farm).