English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 57517/91034 (63%)
造访人次 : 13451850      在线人数 : 298
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/45266

    题名: A generalized fault-tolerant sorting algorithm on a product network
    作者: 張志勇;Chang, Chih-yung;Chen, Yuh-shyan;Lin, Tsung-hung;Kuo, Chun-bo
    贡献者: 淡江大學資訊工程學系
    关键词: Fault-tolerant;Product networks;Snake order;Odd–even sorting;Bitonic sorting
    日期: 2005-03-03
    上传时间: 2010-03-26 18:53:59 (UTC+8)
    出版者: Elsevier
    摘要: A product network defines a class of topologies that are very often used such as meshes, tori, and hypercubes, etc. This paper proposes a generalized algorithm for fault-tolerant parallel sorting in product networks. To tolerate r − 1 faulty nodes, an r-dimensional product network containing faulty nodes is partitioned into a number of subgraphs such that each subgraph contains at most one fault. Our generalized sorting algorithm is divided into two steps. First, a single-fault sorting operation is presented to correctly performed on each faulty subgraph containing one fault. Second, each subgraph is considered a supernode, and a fault-tolerant multiway merging operation is presented to recursively merge two sorted subsequences into one sorted sequence. Our generalized sorting algorithm can be applied to any product network only if the factor graph of the product graph can be embedding in a ring. Further, we also show the time complexity of our sorting operations on a grid, hypercube, and Petersen cube. Performance analysis illustrates that our generalized sorting scheme is a truly efficient fault-tolerant algorithm.
    關聯: Journal of systems architecture 51(3), pp.185-205
    DOI: 10.1016/j.sysarc.2004.11.005
    显示于类别:[資訊工程學系暨研究所] 期刊論文


    档案 大小格式浏览次数



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