National Tsing Hua University Institutional Repository:Embedding Incomplete Binary Trees into Incomplete Hypercubes
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 13695347      在线人数 : 55
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  Embedding Incomplete Binary Trees into Incomplete Hypercubes


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80819


    题名: Embedding Incomplete Binary Trees into Incomplete Hypercubes
    作者: Huang, C. H.;Hsiao, J. Y.;Lee, R. C. T.
    教師: 李家同
    日期: 1998
    出版者: Institution of Engineering and Technology
    關聯: IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, Institution of Engineering and Technology, Volume 145, Issue 6, NOV 1998, Pages 377-384
    关键词: incomplete binary tree
    incomplete hypercube
    embedding
    wormhole routing
    摘要: 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.
    相関连結: http://www.theiet.org/
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80819
    显示于类别:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML980检视/开启


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

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