資料載入中.....
|
請使用永久網址來引用或連結此文件:
http://ir.ncue.edu.tw/ir/handle/987654321/9979
|
題名: | 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.pdf | 13Kb | Adobe PDF | 474 | 檢視/開啟 |
|
在NCUEIR中所有的資料項目都受到原著作權保護.
|