Implementation of Parallel Tree Skeletons on Distributed Systems.
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi · 2002
Trees are useful data types, but developing efficient parallel programs manipulating trees is known to be difficult, because of their irregular and imbalance structure. Parallel tree skeletons are designed to ease parallel programming by encouraging programmers to build parallel programs by combining them. However, for distributed systems, efficient implementations of these parallel tree skeletons are known to be hard. In this