We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
SYSTEMATIC DERIVATION OF TREE CONTRACTION ALGORITHMS.
- Authors
MATSUZAKI, KIMINORI; ZHENJIANG HU; KAKEHI, KAZUHIKO; TAKEICHI, MASATO; Gorlatch, Sergei
- Abstract
While tree contraction algorithms play an important role in efficient tree computation in parallel, it is difficult to develop such algorithms due to the strict conditions imposed on contracting operators. In this paper, we propose a systematic method of deriving efficient tree contraction algorithms from recursive functions on trees. We identify a general recursive form that can be parallelized into efficient tree contraction algorithms, and present a derivation strategy for transforming general recursive functions to the parallelizable form. We illustrate our approach by deriving a novel parallel algorithm for the maximum connected-set sum problem on arbitrary trees, the tree-version of the well-known maximum segment sum problem.
- Subjects
ALGORITHMS; RECURSIVE functions; FOUNDATIONS of arithmetic; RECURSION theory; NUMBER theory
- Publication
Parallel Processing Letters, 2005, Vol 15, Issue 3, p321
- ISSN
0129-6264
- Publication type
Article
- DOI
10.1142/S0129626405002246