Optimal Dynamic Embeddings of Complete Binary Trees.pdfVIP

INTERNATIONAL COMPUTER SCIENCE INSTITUTE Center St Suite Berkeley California FAX I Optimal Dynamic Emb eddings of Complete Binary Trees into Hyp ercub es Volker Heun Ernst W Mayr TR August Abstract The doublero oted complete binary tree is a complete binary tree where the ro ot is replaced by an edge It is folklore that the doublero oted complete binary tree is a spanning tree of the hyp ercub e of the same size Unfortunately the usual construction of an emb edding of a doublero oted complete binary tree into the hyp ercub e do es not provide any hint how this emb edding can b e extended if each leaf spawns two new leaves In this pap er we present simple dynamic emb eddings of doublero oted complete binary trees into hyp ercub es which do not suer from this disadvantage We also present edgedisjoint emb eddings of large binary trees with optimal load and unit dilation Furthermore all these emb eddings can b e eciently implemented on the hyp ercub e itself such that the emb edding of each new level of leaves can b e computed in constant time Since complete binary trees are similar to doublero oted complete binary trees our results can b e immediately transfered to complete binary trees  Institut f ur Informatik der TU Munc hen D Munc hen Germany ii Intro duction Hyp ercub es are a very p opular mo del for parallel computation b ecause of their reg ularity and their relatively small numb er of interpro cessor connections Another imp ortant prop erty of an interconnection network is its ability to eciently simulate the communication of parallel