Simulation of Meshes in a Faulty Supercube with Unbounded Expansion

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

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

Title:	Simulation of Meshes in a Faulty Supercube with Unbounded Expansion
Authors:	Lin, Jen-Chih;Wu, Shih-Jung
Contributors:	淡江大學資訊創新與科技學系
Keywords:	Supercube;Hypercube;Mesh;Torus;Grid Computing
Date:	2011-09
Issue Date:	2013-01-17 22:16:13 (UTC+8)
Publisher:	AICIT
Abstract:	Reconfiguring meshes in a faulty Supercube is investigated in the paper. The result can readily be used in the optimal embedding of a mesh (or a torus) of processors in a faulty Supercube with unbounded expansion. There are embedding algorithms proposed in this paper. These embedding algorithms show a mesh with any number of nodes can be embedded into a faulty Supercube with load 1, congestion 1, and dilation 3 such that O(n2-w2) faults can be tolerated, where n is the dimension of the Supercube and 2w is the number of nodes of the mesh. The meshes and hypercubes are widely used interconnection architectures in parallel computing, grid computing, sensor network, and cloud computing. In addition, the Supercubes are superior to hypercube in terms of embedding a mesh and torus under faults. Therefore, we can easily port the parallel or distributed algorithms developed for these structuring of mesh and torus to the Supercube.
Relation:	International Journal of Advancements in Computing Technology 3(8), p.279-289
DOI:	10.4156/ijact.vol3.issue8.33
Appears in Collections:	[Department of Innovative Information and Technology] Journal Article

Files in This Item:

File	Description	Size	Format
33_IJACT9-8.pdf		800Kb	Adobe PDF	438	View/Open
index.html		0Kb	HTML	142	View/Open