Distributed Fault-Tolerant Embedding of Multiple Networks in Incrementally Extensible Hypercube Graphs

機構典藏 > College of Global Entrepreneurial Development > Department of Innovative Information and Technology > Journal Article > Item 987654321/112505

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

Title:	Distributed Fault-Tolerant Embedding of Multiple Networks in Incrementally Extensible Hypercube Graphs
Authors:	Wu, Shih-Jung, et al.
Keywords:	lEH;Linear Array;Ring;Mesh;Torus;Complete binary tree
Date:	2013-03
Issue Date:	2017-12-22 02:10:37 (UTC+8)
Publisher:	Advanced Institute of Convergence Information Technology
Abstract:	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.
Relation:	IJACT 8(3), p.513-517
DOI:	10.4156/ijact.vol5.issue8.86
Appears in Collections:	[Department of Innovative Information and Technology] Journal Article

Files in This Item:

File	Description	Size	Format
Distributed Fault-Tolerant Embedding of Multiple Networks in Incrementally Extensible Hypercube Graphs.pdf		5601Kb	Adobe PDF	1	View/Open