National Changhua University of Education Institutional Repository : Item 987654321/9979
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6491/11663
造访人次 : 24520656      在线人数 : 67
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻


题名: Embedding Incomplete Binary Trees into Incomplete Hypercubes
作者: Huang, C. H.;Hsiao, Ju-Yuan;Lee, R. C. T.
贡献者: 資訊工程系
关键词: Embedding;Incomplete binary tree;Incomplete hypcraibe;Ll'oriiihole routing
日期: 1999
上传时间: 2012-05-02T09:37:12Z
出版者: Institute of Electrical Engineers
摘要: 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
關聯: IEE Proceeding-Computers and Digital Techniques, 145(6): 377-384
显示于类别:[資訊工程學系] 期刊論文


档案 大小格式浏览次数
2050400410004.pdf13KbAdobe PDF423检视/开启



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