DocumentCode
2386507
Title
Embedding a k-D Torus into a Locally Twisted Cube
Author
Lai, Chia-Jui ; Tsai, Chang-Hsiung ; Li, Tseng-Kui
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Dong Hwa Univ., Hualien, Taiwan
fYear
2010
fDate
8-11 Dec. 2010
Firstpage
104
Lastpage
109
Abstract
The locally twisted cube is one of the most notable variations of hypercube, but some properties of the locally twisted cube are superior to those of the hypercube. For example, the diameter of former is almost the half of that of the later. This paper addresses how to embed a maximal size of multi-dimensional torus into a locally twisted cube. The major contribution of this paper is that for n ≥4, every k-dimensional torus of size 2s1 × 2s2 × ⋯ × 2sk satisfying Σi=1k si = n can be embedded into an n-dimensional locally twisted cube with dilation two and unit expansion. Further, an embedding algorithm can be constructed based on our embedding method and the time complexity of the algorithms linear with respect to the size of the locally twisted cube. The embedding is optimal in the sense that it has unit expansion.
Keywords
computational complexity; hypercube networks; hypercube; interconnection network; k-D torus; k-dimensional torus; locally twisted cube; multidimensional torus; time complexity; unit expansion; Bismuth; Complexity theory; Computer science; Electronic mail; Hypercubes; Zinc; Interconnection networks; Locally twisted cubes; Mesh embedding; Reflected link label sequence; Torus embedding;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2010 International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-9110-0
Electronic_ISBN
978-0-7695-4287-4
Type
conf
DOI
10.1109/PDCAT.2010.21
Filename
5704409
Link To Document