English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6487/11649
Visitors : 28696120      Online Users : 178
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/9979

Title: Embedding Incomplete Binary Trees into Incomplete Hypercubes
Authors: Huang, C. H.;Hsiao, Ju-Yuan;Lee, R. C. T.
Contributors: 資訊工程系
Keywords: Embedding;Incomplete binary tree;Incomplete hypcraibe;Ll'oriiihole routing
Date: 1999
Issue Date: 2012-05-02T09:37:12Z
Publisher: Institute of Electrical Engineers
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, edge-congestion 2 and expansion ratio (N+1)/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)/N. 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: IEE Proceeding-Computers and Digital Techniques, 145(6): 377-384
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat
2050400410004.pdf13KbAdobe PDF461View/Open

All items in NCUEIR are protected by copyright, with all rights reserved.


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback