Parameterization of efficient dynamic reconfigurable trees

We present an algorithm for dynamic reconfiguration from a set of processor nodes connected using a multistage interconnection network into a set of m -ary trees of height h. The algorithm allows parameterization based on the branching factor m, the height of the tree h and bias B and produces a set of isomorphic trees for each value of the bias B. The computation of the id entities of the neighbors by the nodes is performed using simple binary ope rations in parallel. (C) 2000 Elsevier Science B.V. All rights reserved.