Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH

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

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

題名:	Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH
作者:	Wu, Shih-Jung;Jen-Chih Lin;Huan-Chao Keh
貢獻者:	淡江大學資訊創新與科技學系
關鍵詞:	Hypercube;Incrementally Extensible Hypercube;Complete binary tree;Fault-Tolerance;Embedding
日期:	2008-03
上傳時間:	2011-10-20 11:16:14 (UTC+8)
出版者:	Zographou: World Scientific and Engineering Academy and Society
摘要:	Different parallel architectures may require different algorithms to make the existent algorithms on one architecture be easily transformed to or implemented on another architecture. This paper proposes a novel algorithm for embedding complete binary trees in a faulty Incrementally Extensible Hypercube (IEH). Furthermore, to obtain the replaceable node of the faulty node, 2-expansion is permitted such that up to (n+1) faults can be tolerated with dilation 3, congestion 1 and load 1. The presented embedding methods are optimized mainly for balancing the processor loads, while minimizing dilation and congestion as far as possible. According to the result, we can map the parallel algorithms developed by the structure of complete binary tree in an IEH. These methods of reconfiguring enable extremely high-speed parallel computation.
關聯:	WSEAS Transactions on Computers 7(3), p.83-88
顯示於類別:	[資訊工程學系暨研究所] 期刊論文 [資訊創新與科技學系] 期刊論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH.pdf	439Kb	Adobe PDF	615	檢視/開啟
index.html	0Kb	HTML	170	檢視/開啟
index.html	0Kb	HTML	80	檢視/開啟

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

TAIR相關文章