Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube

淡江大學機構典藏 > 商管學院 > 資訊管理學系暨研究所 > 期刊論文 > Item 987654321/27404

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/27404

题名:	Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube
作者:	Lin,Jen-Chih;Chi, Tzong-Heng;Keh, Huan-Chao;Liou, Ay-Hwa Andy
贡献者:	淡江大學資訊管理學系
关键词:	Algorithms;Computer networks;Embedded systems;Fault tolerant computer systems;Trees (mathematics);Binary trees;Computer architecture
日期:	2001-06
上传时间:	2013-06-13 11:28:14 (UTC+8)
出版者:	Amsterdam: Elsevier BV * North-Holland
摘要:	Although the embedding of complete binary trees in faulty hypercubes has received considerable attention, to our knowledge, no paper has demonstrated how to embed a complete binary tree in a faulty Flexible Hypercube. Therefore, this investigation presents an algorithm to facilitate the embedding job when the Flexible Hypercube contains faulty nodes. Of particular concern are the network structures of the Flexible Hypercube that balance the load before as well as after faults start to degrade the performance of the Flexible Hypercube. Furthermore, to obtain the replaceable node of the faulty node, 2-expansion is permitted such that up to (n−2) faults can be tolerated with congestion 1, dilation 4 and load 1.
關聯:	Journal of Systems Architecture 47(7), pp.543-548
DOI:	10.1016/S1383-7621(01)00004-2
显示于类别:	[資訊管理學系暨研究所] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
1383-7621_47(7)p543-548.pdf	70Kb	Adobe PDF	270	检视/开启
Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube.pdf	70Kb	Adobe PDF	1	检视/开启
index.html	0Kb	HTML	68	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章