Effective Approaches for Constructing Fault-Tolerant Communication Trees in Hypercubes
學年 90
學期 1
發表日期 2002-12-18
作品名稱 Effective Approaches for Constructing Fault-Tolerant Communication Trees in Hypercubes
作品名稱（其他語言）
著者 Chuang, Po-Jen; Chen, Shih-Yuan; Chen, Juei-Tang
作品所屬單位 淡江大學電機工程學系
出版者
會議名稱 The 2002 International Computer Symposium=二00二年國際計算機會議
會議地點 花蓮, 臺灣
摘要 Two random search techniques, the genetic algorithm (GA) and the simulated annealing (SA) approaches, are used to construct fault-tolerant communication trees with the lowest data transmission time in this paper. Experimental evaluation shows that with reasonably low search time, the GA and SA approaches are able to find more desirable communication trees, i.e., trees with less data transmission time, than the minimal cost approach. Also provided is a distributed approach with two algorithms able to further reduce search time for the GA and SA approaches due to parallel search for communication subtrees in disjoint subcubes.
關鍵字 容錯; 通訊樹; 超立方; 遺傳演算法; 模擬退火; Fault Tolerance; Communication Tree; Hypercube; Genetic Algorithm; Simulated Annealing
語言 en
收錄於
會議性質 國際
校內研討會地點
研討會時間 20021218~20021221
通訊作者
國別 TWN
公開徵稿
出版型式
出處 Proceedings of the 2002 International Computer Symposium (Volume I)=二00二年國際計算機會議論文集(I), pp.245-252
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/38680 )

機構典藏連結
SDGS 優質教育,產業創新與基礎設施