Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2009.16-A.4.223

Embedding a Mesh of Size 2n ×2m Into a Twisted Cube  

Kim, Sook-Yeon (한경대학교 컴퓨터공학과)
Abstract
The twisted cube has received great attention as an interconnection network of parallel systems because it has several superior properties, especially in diameter, to the hypercube. It was recently known that, for even m, a mesh of size $2{\times}2^m$ can be embedded into a twisted cube with dilation 1 and expansion 1 and a mesh of size $4{\times}2^m$ with dilation 1 and expansion 2 [Lai and Tsai, 2008]. However, as we know, it has been a conjecture that a mesh with more than eight rows and columns can be embedded into a twisted cube with dilation 1. In this paper, we show that a mesh of size $2^n{\times}2^m$ can be embedded into a twisted cube with dilation 1 and expansion $2^{n-1}$ for even m and with dilation 1 and expansion $2^n$ for odd m where $1{\leq}n{\leq}m$.
Keywords
Twisted Cube; Mesh; Embedding; Dilation; Expansion;
Citations & Related Records
연도 인용수 순위
  • Reference
1 W.-T. Huang, J. J. M. Tan, C.-N. Hung, L.-H. Hsu, 'Fault-tolerant hamiltonicity of twisted cubes'. J. Parallel Distrib. Comput. Vol.62, No.4, pp.591-604, 2002   DOI   ScienceOn
2 A. Rosenberg, 'Issues in the study of graph embeddings,' Lecture Notes in Computer Science, Springer-Verlag, New York, Vol.100, pp.150-176, 1981   DOI
3 C.-P. Chang,J.-N. Wang,L.-H. Hsu, 'Topological properties of twisted cube,' Information Sciences, Vol.113, pp.147-167, 1999   DOI   ScienceOn
4 J. Fan, X. Lin, Y. Pan, X. Jia, 'Optimal fault-tolerant embedding of paths in twisted cubes,' J. Parallel Distrib. Comput. Vol.67, No.2, pp.205-214, 2007   DOI   ScienceOn
5 J. Fan, X. Lin, 'The t/k-diagnosability of the BC Graphs,' IEEE Trans. Computers, Vol.54, No.2, pp.176-184, 2005   DOI   ScienceOn
6 S. Abraham, K. Padmanabhan, 'The twisted cube topology for multiprocessors: a study in network asymmetry,' J. Parallel Distrib. Comput. Vol.13, Issue 1, pp.104-110, 1991   DOI   ScienceOn
7 E. Abuelrub, S. Bettayeb, 'Embedding complete binary trees into twisted hypercubes,' Proc. of the Int. Conf. on Computer Applications in Design, Simulation and Analysis, Washington, D.C. March, 10-12, pp.1-4, 1992
8 F. Berman, L. Snyder, 'On mapping parallel algorithms into parallel architectures,' J. Parallel Distrib. Comput. Vol.4, No.5, pp.439.458, 1987   DOI   ScienceOn
9 S.L. Bezrukov, J.D. Chavez, L.H. Harper M. Rottger, U.-P. Schroeder, 'The congestion of n-cube layout on a rectangular grid,' Discrete Math., Vol.213, No.1-3, pp.13-19, Feb., 2000   DOI   ScienceOn
10 V. Chaudhary, J.K. Aggarwal, 'Generalized mapping of parallel algorithms onto parallel architectures,' Proc. Int'l Conf. Parallel Processing, pp. 137-141, Aug., 1990
11 J. Fan, X. Lin, X. Jia, R. W. H. Lau, 'Edge-pancyclicity of twisted cubes,' ISAAC 2005, Lecture Notes in Comput. Sci. Vol.3827, pp.1090-1099, 2005   DOI   ScienceOn
12 J.-S. Fu, 'Fault-free Hamiltonian cycles in twisted cubes with conditional link faults,' Theoretical Computer Science,. 407, No.1-3, pp.318-329, Nov., 2008   DOI   ScienceOn
13 P. A. J. Hilbers, M. R. J.Koopman, J. L. A. van de Snepscheut, 'The twisted cube,' in PARLE:Parallel Architectures and Languages Europe, Parallel Architectures, Vol.1, Springer, Berlin, pp.152-158, 1987
14 C.-J. Lai, C.-H. Tsai, 'Embedding a family of meshes into twisted cubes,' Information Processing Letters,. 108, Issue 5, pp.326-330, Nov., 2008   DOI   ScienceOn
15 M.-C. Yang, T.-K. Li, J. J. M. Tan, L.-H. Hsu, 'On embedding cycles into faulty twisted cubes,' Information Sciences, Vol.176, No.6, pp.676-690, 2006   DOI   ScienceOn
16 A. Matsubayashi, 'VLSI layout of trees into grids of minimum width,' IEICE Trans. Fundamentals, Vol.E87-A, No.5, pp.1059-1069, May, 2004
17 B. Monien, H. Sudborough. 'Embedding one interconnection network in another,' pp.257-282, Springer-Verlag/Wien, 1990. Computing Supplementum 7: Computational Graph Theory
18 A. Patel, A. Kusalik, C. McCrosky, 'Area-efficient VLSI layouts for binary hypercubes,' IEEE Trans. Computers, Vol.49, No.2, pp.160-169, Feb., 2000   DOI   ScienceOn