Title :
Embedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems
Author :
Lin, Tsong-Jie ; Hsieh, Sun-Yuan ; Juan, Justie Su-Tzu
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nan Jeon Inst. of Technol., Tainan, Taiwan
fDate :
6/1/2012 12:00:00 AM
Abstract :
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.
Keywords :
hypercube networks; mesh generation; multiprocessing systems; network theory (graphs); Cartesian product networks; distinct nodes; embedding cycles; embedding paths; generalized hypercubes; nearest neighbor mesh hypercubes; panconnectivity problem; pancycle problem; Educational institutions; Hypercubes; Manganese; Multiprocessing systems; Parallel algorithms; Program processors; Signal processing algorithms; Cartesian product networks; cycle embedding; generalized hypercubes; nearest neighbor mesh hypercubes; panconnectivity problem; pancycle problem; path embedding.;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
DOI :
10.1109/TPDS.2011.245
