A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
An optimal tree contraction algorithm for the boolean hypercube and the constant degree hypercubic networks, such as the shu e exchange or the butter y 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( l n p m log p). The resulting speed-up of O(p= log p) is optimal due to logarithmic communicationdoi:10.1007/pl00009165 fatcat:65pjenki5fhole5albfvo6cw54