關鍵字查詢 | 類別:期刊論文 | | 關鍵字:Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH

[第一頁][上頁]1[次頁][最末頁]目前在第 1 頁 / 共有 02 筆查詢結果
序號 學年期 教師動態
1 96/2 資工系 葛煥昭 教授 期刊論文 發佈 Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH , [96-2] :Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH期刊論文Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEHWu, Shih-Jung; Jen-Chih Lin; Huan-Chao Keh淡江大學資訊創新與科技學系Hypercube;Incrementally Extensible Hypercube;Complete binary tree;Fault-Tolerance;EmbeddingZographou: World Scientific and Engineering Academy and SocietyWSEAS Transactions on Computers 7(3), p.83-88Different 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
2 96/2 資創系 武士戎 教授 期刊論文 發佈 Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH , [96-2] :Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH期刊論文Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEHWu, Shih-Jung; Jen-Chih Lin; Huan-Chao Keh淡江大學資訊創新與科技學系Hypercube;Incrementally Extensible Hypercube;Complete binary tree;Fault-Tolerance;EmbeddingZographou: World Scientific and Engineering Academy and SocietyWSEAS Transactions on Computers 7(3), p.83-88Different 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
[第一頁][上頁]1[次頁][最末頁]目前在第 1 頁 / 共有 02 筆查詢結果