English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 55528/89843 (62%)
造訪人次 : 10973059      線上人數 : 188
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: 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 ©   - 回饋