Implementation of Parallel Tree Skeletons on Distributed Systems (2002)
| Venue: | IN PROCEEDINGS OF THE THIRD ASIAN WORKSHOP ON PROGRAMMING LANGUAGES AND SYSTEMS |
| Citations: | 2 - 2 self |
BibTeX
@INPROCEEDINGS{Matsuzaki02implementationof,
author = {Kiminori Matsuzaki and Zhenjiang Hu and Masato Takeichi},
title = {Implementation of Parallel Tree Skeletons on Distributed Systems},
booktitle = {IN PROCEEDINGS OF THE THIRD ASIAN WORKSHOP ON PROGRAMMING LANGUAGES AND SYSTEMS},
year = {2002},
pages = {258--271},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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
Citations
| 205 | An introduction to the theory of lists - Bird - 1987 |
| 54 | Algorithmic Skeletons: A Structured Approach to the Management of Parallel Computation - Cole - 1988 |
| 49 | Parallelizing complex scans and reductions - Fischer, Ghuloum - 1994 |
| 39 | The Bird-Meertens Formalism as a Parallel Model - Skillicorn - 1992 |
| 17 | Parallelization via Context Preservation - Chin, Takano, et al. - 1998 |
| 17 | E cient parallel algorithms for tree accumulations - Gibbons, Cai, et al. - 1994 |
| 15 | List ranking and parallel tree contraction - Reid-Miller, Miller, et al. - 1993 |
| 8 | Iwasaki: Diffusion: Calculating Efficient Parallel Programs - Hu, Hakeich, et al. - 1999 |
| 2 | Efficient Parallel Skeletons for Nested Data Structures - Takahashi, Iwasaki, et al. - 2001 |
| 1 | Skillicorn: Parallel Implementation of Tree Skeletons - B - 1996 |
