The stapl Skeleton Framework Conference Paper uri icon

abstract

  • © Springer International Publishing Switzerland 2015. This paper describes the stapl Skeleton Framework, a highlevel skeletal approach for parallel programming. This framework abstracts the underlying details of data distribution and parallelism from programmers and enables them to express parallel programs as a composition of existing elementary skeletons such as map, map-reduce, scan, zip, butterfly, allreduce, alltoall and user-defined custom skeletons. Skeletons in this framework are defined as parametric data flow graphs, and their compositions are defined in terms of data flow graph compositions. Defining the composition in this manner allows dependencies between skeletons to be defined in terms of point-to-point dependencies, avoiding unnecessary global synchronizations. To show the ease of composability and expressivity, we implemented the NAS Integer Sort (IS) and Embarrassingly Parallel (EP) benchmarks using skeletons and demonstrate comparable performance to the hand-optimized reference implementations. To demonstrate scalable performance, we show a transformation which enables applications written in terms of skeletons to run on more than 100,000 cores.

name of conference

  • Languages and Compilers for Parallel Computing - 27th International Workshop, LCPC 2014, Hillsboro, OR, USA, September 15-17, 2014, Revised Selected Papers

published proceedings

  • LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING (LCPC 2014)

altmetric score

  • 3

author list (cited authors)

  • Zandifar, M., Thomas, N., Amato, N. M., & Rauchwerger, L

citation count

  • 5

complete list of authors

  • Zandifar, Mani||Thomas, Nathan||Amato, Nancy M||Rauchwerger, Lawrence

editor list (cited editors)

  • Brodman, J. C., & Tu, P.

publication date

  • May 2015