.png){kind=icon}
返回
A generalized fault-tolerant sorting algorithm on a product network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sysarc.2004.11.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (c) 2004 Elsevier B.V. All rights reserved.
Keyword:
fault-tolerant
product networks
snake order
odd-even sorting
bitonic sorting
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
Psychoacoustic and Phoneme Identification Measures in Cochlear-Implant and Normal-Hearing Listeners
OAAI
OAAI分享收藏
查看更多内容