National Tsing Hua University Institutional Repository:Embedding Incomplete Binary Trees into Incomplete Hypercubes
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 15039542      Online Users : 108
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    NTHUR > Presidents > Lee, Richard Chia-Tung (1993-1994) > LRCT Journal / Magazine Articles  >  Embedding Incomplete Binary Trees into Incomplete Hypercubes

    Please use this identifier to cite or link to this item:

    Title: Embedding Incomplete Binary Trees into Incomplete Hypercubes
    Authors: Huang, C. H.;Hsiao, J. Y.;Lee, R. C. T.
    Teacher: 李家同
    Date: 1998
    Publisher: Institution of Engineering and Technology
    Relation: IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, Institution of Engineering and Technology, Volume 145, Issue 6, NOV 1998, Pages 377-384
    Keywords: incomplete binary tree
    incomplete hypercube
    wormhole routing
    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 Link:
    Appears in Collections:[Lee, Richard Chia-Tung (1993-1994)] LRCT Journal / Magazine Articles
    [Department of Computer Science] CS Journal / Magazine Articles

    Files in This Item:

    File SizeFormat


    SFX Query


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