A generalized fault-tolerant sorting algorithm on a product network

doi:10.1016/j.sysarc.2004.11.005

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/45266

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
	0Kb	Unknown	414	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....