Parallel skeletons for manipulating general trees

Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficient parallel programs manipulating trees, because of their irregular and ill-balanced structures. In this paper, we propose a solution based on the skeletal approach. We formalize a set of skeletons (abstracted computational patterns) for rose trees (general trees of arbitrary shapes) based on the theory of Constructive Algorithmics. Our skeletons for rose trees are extensions of those proposed for lists and binary trees. We show that we can implement the skeletons efficiently in parallel, by combining the parallel binary-tree skeletons for which efficient parallel implementations are already known. As far as we are aware, we are the first who have formalized and implemented a set of simple but expressive parallel skeletons for rose trees.

• Type: Journal
• Year: 2006
• Where: PC
• Authors: Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
• Keywords: Efficient Parallel Programs, Parallel Binary-tree Skeletons, PC 2006, Programming Languages, Skeletons