教師資料查詢 | 類別: 期刊論文 | 教師: 葛煥昭 Keh Huan-chao (瀏覽個人網頁)

標題:Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH
學年96
學期2
出版(發表)日期2008/03/01
作品名稱Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH
作品名稱(其他語言)
著者Wu, Shih-Jung; Jen-Chih Lin; Huan-Chao Keh
單位淡江大學資訊創新與科技學系
出版者Zographou: World Scientific and Engineering Academy and Society
著錄名稱、卷期、頁數WSEAS Transactions on Computers 7(3), p.83-88
摘要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.
關鍵字Hypercube;Incrementally Extensible Hypercube;Complete binary tree;Fault-Tolerance;Embedding
語言英文
ISSN1109-2750; 2224-2872
期刊性質國外
收錄於SCI;EI;
產學合作
通訊作者
審稿制度
國別希臘
公開徵稿
出版型式,紙本
相關連結
Google+ 推薦功能,讓全世界都能看到您的推薦!