The Accelerated Centroid Decomposition Technique For Optimal Parallel Tree Evaluation In Logarithmic Time (1986)
| Citations: | 36 - 3 self |
BibTeX
@MISC{Cole86theaccelerated,
author = {Richard Cole and Uzi Vishkin},
title = {The Accelerated Centroid Decomposition Technique For Optimal Parallel Tree Evaluation In Logarithmic Time},
year = {1986}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A new general parallel algorithmic technique for computations on trees is presented. The new technique performs a reduction of the tree expression evaluation problem to list ranking; then, the list ranking provides a schedule for evaluating the tree operations. The technique needs logarithmic time using an optimal number of processors and has applications to other tree problems. This new technique enables us to systematically order four basic ideas and techniques for parallel algorithms on tree: (1) The list ranking problem. (2) The Euler tour technique on trees. (3) The centroid decomposition technique. (4) The new accelerated centroid decomposition (ACD) technique. 1. Introduction The model of parallel computation used in this paper is the concurrent-read exclusive-write (CREW) parallel random access machine (PRAM). A PRAM employs p synchronous processors all having access to a common memory. A CREW PRAM allows concurrent access by several processors to the same common memo...
