Distributed Fault-Tolerant Embedding of Multiple Networks in Incrementally Extensible Hypercube Graphs

淡江大學機構典藏 > 全球發展學院 > 資訊創新與科技學系 > 期刊論文 > Item 987654321/112505

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/112505

題名:	Distributed Fault-Tolerant Embedding of Multiple Networks in Incrementally Extensible Hypercube Graphs
作者:	Wu, Shih-Jung, et al.
關鍵詞:	lEH;Linear Array;Ring;Mesh;Torus;Complete binary tree
日期:	2013-03
上傳時間:	2017-12-22 02:10:37 (UTC+8)
出版者:	Advanced Institute of Convergence Information Technology
摘要:	The performance of parallel and distributed computer systems depends on the effectiveness of the underlying interconnection network. Embedding is ofgreat importance in the applications ofparallel and distributed computer systems. This paper presents embedding multiple networks into a faulty Incrementally Extensible Hypercube, including linear array, ring, mesh, torus, and double-rooted complete binary tree. To obtain the replaceable node ofthe faulty node, 2-expansion is permitted such that up to (n+ 1) faults can be tolerated with dilation 3, congestion I and load 1. It is demonstrated that O(n) faults can be tolerated. Furthermore, the presented embedding methods are optimized mainly for balancing the processor loads, while minimizing load as far as possible. Based on these results, this methodology of embedding enables extremely high-speed parallel and distributed computation. Moreover, the technology can be applied in grid computing and cloud computing.
關聯:	IJACT 8(3), p.513-517
DOI:	10.4156/ijact.vol5.issue8.86
顯示於類別:	[資訊創新與科技學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
Distributed Fault-Tolerant Embedding of Multiple Networks in Incrementally Extensible Hypercube Graphs.pdf		5601Kb	Adobe PDF	1	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章