Issue No. 06 - June (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.245
Tsong-Jie Lin , Nan Jeon Institute of Technology, Tainan
Sun-Yuan Hsieh , National Cheng Kung University, Tainan
Justie Su-Tzu Juan , National Chi Nan University, Nantou
In this paper, we consider two embedding problems in Cartesian product networks: one is the pancycle problem, which involves embedding cycles of various lengths in the given product network; and the other is the panconnectivity problem, which involves embedding paths of various lengths between any pair of distinct nodes in the given product network. We then apply our technical lemmas and theorems to derive new topological properties of two multiprocessor systems, namely, generalized hypercubes and nearest neighbor mesh hypercubes.
Cartesian product networks, cycle embedding, generalized hypercubes, nearest neighbor mesh hypercubes, pancycle problem, panconnectivity problem, path embedding.
J. S. Juan, S. Hsieh and T. Lin, "Embedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 1081-1089, 2011.