Please use this identifier to cite or link to this item:
|Title: ||Embedding Incomplete Binary Trees into Incomplete Hypercubes|
|Authors: ||Huang, C. H.;Hsiao, Ju-Yuan;Lee, R. C. T.|
|Keywords: ||Embedding;Incomplete binary tree;Incomplete hypcraibe;Ll'oriiihole routing|
|Issue Date: ||2012-05-02T09:39:14Z
|Abstract: ||It has been proved that an incomplete binary tree cannot be embedded into an incomplete hypercube with dilation 1 and expansion 1. By applying some properties of inorder traversal, the authors present an embedding scheme with dilation 2, edgecongestion 2 and expansion ratio (N + l)/N,|
where N is the number of nodes in an incomplete binary tree. The authors prove that this embedding is optimal under the constraint of expansion ratio (N + 1)iN. With this embedding scheme, a method is developed that can be used to simulate a binary tree on an incomplete hypercube effectively. Under the distributed environment, the mapping addresses of neighbouring nodes in an incomplete binary tree can be identified in constant time without repeating the mapping work. Furthermore, experimental results show that this scheme is much better than the corresponding best known dilation 1 embedding scheme in terms of hardware costs and implementation. Even in total time costs (addressing time, computation time and transmission time), this approach is quite competitive.
|Relation: ||International Conference on Theoretical Computer Science, Hongkong, 1998|
|Appears in Collections:||[資訊工程學系] 會議論文|
Files in This Item:
All items in NCUEIR are protected by copyright, with all rights reserved.