Efficient Parallel Algorithms for Tree Accumulations (1994)
by
Jeremy Gibbons
,
Wentong Cai
,
David B. Skillicorn
| Venue: | Science of Computer Programming |
| Citations: | 17 - 7 self |
BibTeX
@ARTICLE{Gibbons94efficientparallel,
author = {Jeremy Gibbons and Wentong Cai and David B. Skillicorn},
title = {Efficient Parallel Algorithms for Tree Accumulations},
journal = {Science of Computer Programming},
year = {1994},
volume = {23},
pages = {1--18}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Accumulations are higher-order operations on structured objects; they leave the shape of an object unchanged, but replace elements of that object with accumulated information about other elements. Upwards and downwards accumulations on trees are two such operations; they form the basis of many tree algorithms. We present two Erew Pram algorithms for computing accumulations on trees taking O(log n) time on O(n= log n) processors, which is optimal.
Citations
| 259 | Parallel prefix computation - Ladner, Fischer - 1980 |
| 227 | The parallel evaluation of general arithmetic expressions - Brent - 1974 |
| 165 | The Design and Analysis of Parallel Algorithms - Akl - 1989 |
| 117 | Parallel tree contraction and its application - Miller, Reif - 1985 |
| 83 | A Simple Parallel Tree Contraction Algorithm - Abrahamson, Dadoun, et al. |
| 58 | Approximate and exact parallel scheduling with applications to list, tree, and graph problems - COLE, VISHIUN - 1986 |
| 25 | Upwards and downwards accumulations on trees - Gibbons - 1993 |
| 21 | Algebras for Tree Algorithms - Gibbons - 1991 |
| 9 | Computing downwards accumulations on trees quickly - Gibbons - 1996 |
| 9 | Efficient parallel algorithms for solving some tree problems - He - 1986 |
