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

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

    题名: Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH
    作者: Wu, Shih-Jung;Jen-Chih Lin;Huan-Chao Keh
    贡献者: 淡江大學資訊創新與科技學系
    关键词: Hypercube;Incrementally Extensible Hypercube;Complete binary tree;Fault-Tolerance;Embedding
    日期: 2008-03
    上传时间: 2011-10-20 11:16:14 (UTC+8)
    出版者: Zographou: World Scientific and Engineering Academy and Society
    摘要: Different parallel architectures may require different algorithms to make the existent algorithms on one architecture be easily transformed to or implemented on another architecture. This paper proposes a novel algorithm for embedding complete binary trees in a faulty Incrementally Extensible Hypercube (IEH). Furthermore, to obtain the replaceable node of the faulty node, 2-expansion is permitted such that up to (n+1) faults can be tolerated with dilation 3, congestion 1 and load 1. The presented embedding methods are optimized mainly for balancing the processor loads, while minimizing dilation and congestion as far as possible. According to the result, we can map the parallel algorithms developed by the structure of complete binary tree in an IEH. These methods of reconfiguring enable extremely high-speed parallel computation.
    關聯: WSEAS Transactions on Computers 7(3), p.83-88
    显示于类别:[資訊工程學系暨研究所] 期刊論文
    [資訊創新與科技學系] 期刊論文


    档案 描述 大小格式浏览次数
    Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH.pdf439KbAdobe PDF519检视/开启



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