期刊論文
| 學年 | 101 |
|---|---|
| 學期 | 2 |
| 出版（發表）日期 | 2013-03-01 |
| 作品名稱 | Distributed Fault-Tolerant Embedding of Multiple Networks in Incrementally Extensible Hypercube Graphs |
| 作品名稱（其他語言） | |
| 著者 | Wu, Shih-Jung, et al. |
| 單位 | |
| 出版者 | |
| 著錄名稱、卷期、頁數 | IJACT 8(3), p.513-517 |
| 摘要 | 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. |
| 關鍵字 | lEH;Linear Array;Ring;Mesh;Torus;Complete binary tree |
| 語言 | en |
| ISSN | 2005-8039 |
| 期刊性質 | 國外 |
| 收錄於 | |
| 產學合作 | |
| 通訊作者 | Wu, Shih-Jung |
| 審稿制度 | 否 |
| 國別 | KOR |
| 公開徵稿 | |
| 出版型式 | ,電子版 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/112505 ) |