Effective Approaches for Constructing Fault-Tolerant Communication Trees in Hypercubes

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Proceeding > Item 987654321/38680

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/38680

Title:	Effective Approaches for Constructing Fault-Tolerant Communication Trees in Hypercubes
Authors:	Chuang, Po-Jen;Chen, Shih-Yuan;Chen, Juei-Tang
Contributors:	淡江大學電機工程學系
Keywords:	容錯;通訊樹;超立方;遺傳演算法;模擬退火;Fault Tolerance;Communication Tree;Hypercube;Genetic Algorithm;Simulated Annealing
Date:	2002
Issue Date:	2013-03-07 14:55:44 (UTC+8)
Abstract:	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.
Relation:	Proceedings of the 2002 International Computer Symposium (Volume I)=二00二年國際計算機會議論文集(I), pp.245-252
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Proceeding

Files in This Item:

There are no files associated with this item.