Embedding a family of disjoint multi-dimensional meshes into a crossed cube

Information Processing Letters

Volumn 108, Issue 6, 2008, Pages 394-397

  Dong, Qiang ^a   Yang, Xiaofan ^a   Zhao, Juan ^b  

^a CHONGQING UNIVERSITY   (China)

^b Aba Teachers College   (China)

Author keywords

Crossed cube; Graph embedding; Interconnection networks; Multi dimensional mesh

Indexed keywords

CROSSED CUBE; CROSSED CUBES; GRAPH EMBEDDING; HYPER CUBES; INTERCONNECTION NETWORKS; MULTI-DIMENSIONAL; MULTI-DIMENSIONAL MESH; PAPER ADDRESSES;

EID: 53049089587     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.07.013     Document Type: Article

References (23)

1. Abraham S., and Padmanabhan K. The twisted cube topology for multiprocessors: a study in network asymmetry. Journal of Parallel and Distributed Computing 13 1 (1991) 104-110
2. Chang C.-P., Sung T.-Y., and Hsu L.-H. Edge congestion and topological properties of crossed cubes. IEEE Transactions on Parallel and Distributed Systems 11 1 (2000) 64-80
3. Cull P., and Larson S.M. The Möbius cubes. IEEE Transactions on Computers 54 2 (1995) 647-659
4. Diestel R. Graph Theory (2005), Springer-Verlag/Heidelberg, New York
5. Dong Q., Yang X., Zhao J., and Tang Y.Y. Embedding a family of disjoint 3D meshes into a crossed cube. Information Sciences 178 11 (2008) 2396-2405
6. Efe K. The crossed cube architecture for parallel computing. IEEE Transactions on Parallel and Distributed Systems 3 5 (1992) 513-524
7. Fan J. Diagnosability of crossed cubes under the comparison diagnosis model. IEEE Transactions on Parallel and Distributed Systems 13 10 (2002) 1099-1104
8. Fan J., and Jia X. Embedding meshes into crossed cubes. Information Sciences 177 15 (2007) 3151-3160
9. Fan J., Jia X., and Lin X. Complete path embeddings in crossed cubes. Information Sciences 176 22 (2006) 3332-3346
10. Fan J., and Jia X. Edge-pancyclicity and path-embeddability of bijective connection graphs. Information Sciences 178 2 (2007) 340-351
11. Fan J., and Lin X. The t / k-diagnosability of the BC graphs. IEEE Transactions on Computers 54 2 (2005) 176-184
12. Fan J., Lin X., and Jia X. Optimal path embedding in crossed cubes. IEEE Transactions on Parallel and Distributed Systems 16 12 (2005) 1190-1200
13. Hung H.-S., Fu J.-S., and Chen G.-H. Fault-free Hamiltonian cycles in crossed cubes with conditional link faults. Information Sciences 177 24 (2007) 5664-5674
14. Kulasinghe P. Connectivity of the crossed cube. Information Processing Letters 61 4 (1997) 221-226
15. Kulasinghe P., and Bettayeb S. Embedding binary trees into crossed cubes. IEEE Transactions on Computers 44 7 (1995) 923-929
16. Parhami B. An Introduction to Parallel Processing: Algorithms and Architectures (1999), Plenum Press, New York
17. S. Ranka, J. Wang, N. Yeh, Embedding meshes on the star graph, in: Proceedings of Supercomputing, New York, NY, 1990, pp. 476-485
18. Ruskey F., and Sawada J. Bent Hamilton cycles in d-dimensional grid graphs. Electronic Journal of Combinatorics 10 1 (2003) R1
19. Xu J.-M., Ma M., and Lv M. Paths in Möbius cubes and crossed cubes. Information Processing Letters 97 3 (2006) 94-97
20. Yang M.-C., Li T.-K., Tan J.J.M., and Hsu L.-H. Fault-tolerant cycle-embedding of crossed cubes. Information Processing Letters 88 4 (2003) 149-154
21. Yang X., Evans D.J., and Megson G.M. The locally twisted cubes. International Journal of Computer Mathematics 82 4 (2005) 401-413
22. Yang X., and Megson G.M. On the double-vertex-cycle-connectivity of crossed cubes. Parallel Algorithms and Applications 19 1 (2004) 11-17
23. Yang X., Megson G.M., and Evans D.J. A comparison-based diagnosis algorithm tailored for crossed cube multiprocessor systems. Microprocessors and Microsystems 29 4 (2005) 169-175