Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2008.15-A.6.301

Embedding a Mesh into a Crossed Cube  

Kim, Sook-Yeon (한경대학교 컴퓨터공학과)
Abstract
The crossed cube has received great attention because it has equal or superior properties to the hypercube that is widely known as a versatile parallel processing system. It has been known that a mesh of size $2{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 and a mesh of size $4{\times}2^m$ with dilation 1 and expansion 2. However, as we know, it has been a conjecture that a mesh with more than eight rows and columns can be embedded into a crossed cube with dilation 1. In this paper, we show that a mesh of size $2^n{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion $2^{n-1}$ where $n{\geq}1$ and $m{\geq}3$.
Keywords
Crossed Cube; Mesh; Embedding; Dilation; Expansion;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Q. Dong, X. Yang, J. Zhao and Y.Y. Tang, “Embedding a family of disjoint 3D meshes into a crossed cube,” Information Sciences, Vol.178, Issue 11, pp.2396-2405, June, 2008   DOI   ScienceOn
2 J. Fan, “Diagnosability of crossed cubes under the comparison diagnosis model,” IEEE Trans. Parallel and Distributed Systems, Vol.13, No.10, pp.1099-1104, Oct., 2002   DOI   ScienceOn
3 C.-P. Chang, T.-Y. Sung, and L.-H. Hsu, “Edge congestion and topological properties of crossed cubes,” IEEE Trans. Parallel and Distributed Systems, Vol.11, No.1, pp.64-80, Jan., 2000   DOI   ScienceOn
4 K. Efe, “The crossed cube architecture for parallel computing,” IEEE Trans. Parallel and Distributed Systems, Vol.3, No.5, pp.513-524, Sept.-Oct., 1992   DOI   ScienceOn
5 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
6 B. Monien and H. Sudborough. “Embedding one interconnection network in another,” pp.257-282, Springer-Verlag/Wien, 1990. Computing Supplementum 7: Computational Graph Theory   DOI
7 F. Berman and L. Snyder, “On mapping parallel algorithms into parallel architectures,” J. Parallel Distrib. Comput. Vol.4, pp.439-458, 1987   DOI   ScienceOn
8 S.L. Bezrukov, J.D. Chavez, L.H. Harper M. Rottger, and 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
9 V. Chaudhary and J.K. Aggarwal, “Generalized mapping of parallel algorithms onto parallel architectures,” Proc. Int'l Conf. Parallel Processing, pp.137-141, Aug., 1990
10 K. Efe, “A variation on the hypercube with lower diameter,” IEEE Trans. Computers, Vol.40, No.11, pp.1312-1316, Nov., 1991   DOI   ScienceOn
11 K. Efe, P.K. Blachwell, W. Slough, and T. Shiau, “Topological properties of the crossed cube architecture,” Parallel Computing, Vol.20, pp.1763-1775, 1994   DOI   ScienceOn
12 J. Fan, and X. Jia, “Embedding meshes into crossed cubes,” Information Sciences Vol.177, Issue 15, pp.3151–3160, 2007   DOI   ScienceOn
13 P. Kulasinghe and S. Bettayeb, “Embedding binary trees into crossed cubes,” IEEE Trans. Computers, Vol.44, No.7, pp.923-929, Jul., 1995   DOI   ScienceOn
14 J. Fan and X. Lin, “The t/k-diagnosability of the BC graphs,” IEEE Trans. Computers, Vol.53, No.2, pp.176-184, Feb., 2005   DOI   ScienceOn
15 W.-T. Huang, Y.-C. Chuang, J.M. Tan, and L.-H. Hsu, “On the fault-tolerant hamiltonicity of faulty crossed cubes,” IEICE Trans. Fundamentals, Vol.E85-A, No.6, pp.1359-1370, Jun., 2002
16 P. Kulasinghe, “Connectivity of the crossed cube,” Information Processing Letters, Vol.61, pp.221-226, Jul., 1997   DOI   ScienceOn
17 A. Matsubayashi, “VLSI layout of trees into grids of minimum width,” IEICE Trans. Fundamentals, Vol.E87-A, No.5, pp.1059-1069, May., 2004
18 A. Patel, A. Kusalik, and C. McCrosky, “Area-efficient VLSI layouts for binary hypercubes,” IEEE Trans. Computers, Vol.49, No.2, pp.160-169, Feb., 2000   DOI   ScienceOn
19 M.-C. Yang, T.-K. Li, J.J.M. Tan, and L.-H. Hsu, “Fault-tolerant cycle-embedding of crossed cubes,” Information Processing Letters, Vol.88, No.4, pp.149-154, Nov., 2003   DOI   ScienceOn