English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62805/95882 (66%)
造访人次 : 3972835      在线人数 : 473
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/80159

    题名: Distributed Fault-Tolerant Embeddings of Rings in Incrementally Extensible Hypercubes with Unbounded Expansion
    作者: Wu, Shih-Jung, et al.
    贡献者: 淡江大學資訊創新與科技學系;淡江大學資訊工程學系
    关键词: Incrementally Extensible Hypercube IEH;Fault-Tolerant;Embedding;Linear Array;Ring
    日期: 2006-06
    上传时间: 2013-01-18 16:48:19 (UTC+8)
    出版者: 淡江大學
    摘要: The Incrementally Extensible Hypercube (IEH) is a generalization of interconnection network that is derived from the hypercube. Unlike the hypercube, the IEH can be constructed for any number of nodes. That is, the IEH is incrementally expandable. In this paper, the problem of embedding and reconfiguring ring structures is considered in an IEH with faulty nodes. There are a novel embedding algorithm proposed in this paper. The embedding algorithm enables us to obtain the good embedding of a ring into a faulty IEH with unbounded expansion, and such the result can be tolerated up to O(n*log2m ) faults with congestion 1, load 1, and dilation 4. The presented embedding methods are optimized mainly for balancing the processor loads, while minimizing dilation and congestion as far as possible.
    關聯: Tamkang Journal of Science and Engineering 9(2), p.121-128
    显示于类别:[資訊工程學系暨研究所] 期刊論文
    [資訊創新與科技學系] 期刊論文


    档案 描述 大小格式浏览次数
    9-2-6.pdf630KbAdobe PDF436检视/开启



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