International Journal of Parallel Programming

, Volume 44, Issue 3, pp 686–707

A Generic Implementation of Tree Skeletons

Article

DOI: 10.1007/s10766-015-0365-6

Cite this article as:
Sato, S. & Matsuzaki, K. Int J Parallel Prog (2016) 44: 686. doi:10.1007/s10766-015-0365-6

Abstract

In data-parallel skeleton libraries, the implementation of skeletons is usually tightly-coupled with that of data structures. However, loose coupling between them like C++ STL will improve modularity and flexibility of skeletons and data structures. This flexibility is particularly valuable for tree skeletons. To achieve such loose coupling, we present an iterator-based interface of trees for tree skeletons. We have implemented tree skeletons on the basis of our interface; we present their design and implementation. This paper also reports the results of preliminary experiments.

Keywords

Algorithmic skeleton Tree Iterator C++ template 

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.University of Electro-CommunicationsTokyoJapan
  2. 2.School of InformationKochi University of TechnologyKochiJapan