FAULT-TOLERANT PARALLEL K-SELECTION ALGORITHM IN N-CUBE NETWORKS

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Electrical Engineering > journal & Dissertation > Item 987654321/29475

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29475

Title:	FAULT-TOLERANT PARALLEL K-SELECTION ALGORITHM IN N-CUBE NETWORKS
Authors:	SHEU,JP
Contributors:	電機工程研究所
Date:	1991
Issue Date:	2010-06-29 20:25:41 (UTC+8)
Publisher:	中央大學
Abstract:	In this paper, a parallel algorithm to select the first k largest numbered processes in n-cube networks is proposed. The proposed algorithm can tolerate at most n - 1 faults. The time complexity of this algorithm is 0(max(kn, n2)).
Relation:	INFORMATION PROCESSING LETTERS
Appears in Collections:	[Graduate Institute of Electrical Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	501	View/Open

社群 sharing