| A generalized fault-tolerant sorting algorithm on a product network | |
|---|---|
| 學年 | 93 |
| 學期 | 2 |
| 出版（發表）日期 | 2005-03-03 |
| 作品名稱 | A generalized fault-tolerant sorting algorithm on a product network |
| 作品名稱（其他語言） | |
| 著者 | 張志勇; Chang, Chih-yung; Chen, Yuh-shyan; Lin, Tsung-hung; Kuo, Chun-bo |
| 單位 | 淡江大學資訊工程學系 |
| 出版者 | Elsevier |
| 著錄名稱、卷期、頁數 | Journal of systems architecture 51(3), pp.185-205 |
| 摘要 | 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. |
| 關鍵字 | Fault-tolerant;Product networks;Snake order;Odd–even sorting;Bitonic sorting |
| 語言 | en |
| ISSN | 1383-7621 |
| 期刊性質 | 國外 |
| 收錄於 | |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 否 |
| 國別 | NLD |
| 公開徵稿 | |
| 出版型式 | ,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45266 ) |
GoogleAnalytics