User: Guest  Login
Document type:
Technical Report 
Author(s):
Ernst W. Mayr; Ralph Werchner 
Title:
Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks 
Abstract:
An optimal tree contraction algorithm for the boolean hypercube and the constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on novel routing techniques and, for certain small subtrees, simulates optimal PRAM algorithms. For trees of size $n$, stored on a $p$ processor hypercube in in-order, the running time of the algorithm is $O(\lc\frac{n}{p}\rc\log p)$. The resulting speed-up of $O(p/\log p)$ is optimal due to logari...    »
 
Keywords:
parallel algorithms; hypercube; tree contraction; term matching; optimal speed-up 
Year:
1995 
Year / month:
1995-11-08 00:00:00 
Pages:
17