English  |  正體中文  |  简体中文  |  Items with full text/Total items : 56826/90532 (63%)
Visitors : 12251445      Online Users : 74
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45266


    Title: A generalized fault-tolerant sorting algorithm on a product network
    Authors: 張志勇;Chang, Chih-yung;Chen, Yuh-shyan;Lin, Tsung-hung;Kuo, Chun-bo
    Contributors: 淡江大學資訊工程學系
    Keywords: Fault-tolerant;Product networks;Snake order;Odd–even sorting;Bitonic sorting
    Date: 2005-03-03
    Issue Date: 2010-03-26 18:53:59 (UTC+8)
    Publisher: Elsevier
    Abstract: 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.
    Relation: Journal of systems architecture 51(3), pp.185-205
    DOI: 10.1016/j.sysarc.2004.11.005
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File SizeFormat
    0KbUnknown342View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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