會議論文
| 學年 | 86 |
|---|---|
| 學期 | 1 |
| 發表日期 | 1997-12-10 |
| 作品名稱 | Embedding a complete binary tree into a faulty supercube |
| 作品名稱（其他語言） | |
| 著者 | Keh, Huan-chao; Lin, Jen-chih |
| 作品所屬單位 | 淡江大學資訊工程學系 |
| 出版者 | |
| 會議名稱 | Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on |
| 會議地點 | Melbourne, Australia |
| 摘要 | The supercube is a novel interconnection network that is derived from the hypercube. Unlike the hypercube, the supercube can be constructed for any number of nodes. That is, the supercube is incrementally expandable. In addition, the supercube retains the connectivity and diameter properties of the corresponding hypercube. In this paper, we consider the problem of embedding and reconfiguring binary tree structures in a faulty supercube. Further more, for finding the replaceable node of the faulty node, we allow 2-expansion such that we can show that up to (n-2) faults can be tolerated with congestion 1 and dilation 4 that is (n-1) is the dimension of a supercube |
| 關鍵字 | |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | |
| 研討會時間 | 19971210~19971212 |
| 通訊作者 | |
| 國別 | AUS |
| 公開徵稿 | Y |
| 出版型式 | |
| 出處 | Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on, pp.323-330 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/37675 ) |