
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
TsongJie Lin, SunYuan Hsieh, Justie SuTzu Juan, "Embedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 6, pp. 10811089, June, 2012.  
BibTex  x  
@article{ 10.1109/TPDS.2011.245, author = {TsongJie Lin and SunYuan Hsieh and Justie SuTzu Juan}, title = {Embedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {23}, number = {6}, issn = {10459219}, year = {2012}, pages = {10811089}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.245}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Embedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems IS  6 SN  10459219 SP1081 EP1089 EPD  10811089 A1  TsongJie Lin, A1  SunYuan Hsieh, A1  Justie SuTzu Juan, PY  2012 KW  Cartesian product networks KW  cycle embedding KW  generalized hypercubes KW  nearest neighbor mesh hypercubes KW  pancycle problem KW  panconnectivity problem KW  path embedding. VL  23 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] S.G. Akl, Parallel Computation: Models and Methods. Prentice Hall, 1997.
[2] B. Alspach and D. Hare, "EdgePancyclic BlockIntersection Graphs," Discrete Math., vol. 97, nos. 13, pp. 1724, 1991.
[3] M. Anantha, B. Bose, and B. AlBdaiwi, "Mixed Radix Gray Codes," IEEE Trans. Computers, vol. 56, no. 10, pp. 12971307, Oct. 2007.
[4] M. Bae and B. Bose, "Edge Disjoint Hamiltonian Cycles in $k$ Ary $n$ Cube and Hypercubes," IEEE Trans. Computers, vol. 52, no. 10, pp. 12711284, Oct. 2003.
[5] L.N. Bhuyan and D.P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. C33, no. 4, pp. 323333, Apr. 1984.
[6] J.A. Bondy, "Pancyclic Graphs," J. Combinatorial Theory, Series B, vol. 11, no. 1, pp. 8084, 1971.
[7] R.V. Boppana, S. Chalasani, and C.S. Raghavendra, "Resource Deadlock and Performance of Whormhole Multicast Routing Algorithms," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 6, pp. 535549, June 1998.
[8] V.V. Dimakopoulos, L. Palios, and A.S. Poulakidas, "On the Hamiltonicity of the Cartesian Product," Information Processing Letters, vol. 96, no. 2, pp. 4953, 2005.
[9] S.Y. Hsieh and T.J. Lin, "Panconnectivity and EdgePancyclicity of $k$ Ary $n$ Cubes," Networks, vol. 54, no. 1, pp. 111, 2009.
[10] R.E. Kessler and J.L. Schwarzmeier, "Cray T3D: A New Dimension for Cray Research," Proc. Compcon Spring '93, Digest of Papers, pp. 176182, 1993.
[11] F.T. Leighton, Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
[12] X. Lin, P.K. Mckinley, and L.M. Ni, "DeadlockFree Multicast Whormhole Routing in 2D Mesh Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, pp. 793804, Aug. 1994.
[13] W. Najjar and J.L. Gaudiot, "Network Resilience: A Measure of Network Fault Tolerance," IEEE Trans. Computers, vol. 39, no. 2, pp. 174181, Feb. 1990.
[14] J.H. Park, "Panconnectivity and EdgePancyclicity of Faulty Recursive Circulant $G(2^m,4)$ ," Theoretical Computer Science, vol. 390, no. 1, pp. 7080, 2008.
[15] Z.M. Song and Y.S. Qin, "A New Sufficient Condition for Panconnected Graphs," Ars Combinatoria, vol. 34, pp. 161166, 1992.
[16] I.A. Stewart and Y. Xiang, "Bipanconnectivity and Bipancyclicity in $k$ Ary $n$ Cubes," IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 1, pp. 2533, Jan. 2009.
[17] D. Wang, T. An, M. Pan, K. Wang, and S. Qu, "HamiltonianLike Properties of $k$ Ary $n$ Cubes," Proc. Sixth Int'l Conf. Parallel and Distributed Computing, Applications and Technologies (PDCAT '05), pp. 10021007, 2005.
[18] N.C. Wang, C.P. Chu, and T.S. Chen, "A DualHamiltonianPathBased Multicasting Strategy for WormholeRouted Star Graph Interconnection Networks," J. Parallel and Distributed Computing, vol. 62, no. 12, pp. 17471762, 2002.
[19] N.C. Wang, C.P. Yen, and C.P. Chu, "Multicast Communication in WormholeRouted Symmetric Networks with Hamiltonian Cycle Model," J. Systems Architecture, vol. 51, no. 3, pp. 165183, 2005.
[20] J.M. Xu, Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, 2001.
[21] J.M. Xu and M. Ma, "A Survey on Cycle and Path Embedding in Some Networks," Frontiers of Math. in China, vol. 4, no. 2, pp. 217252, 2009.
[22] M. Xu, X.D. Hu, and J.M. Xu, "EdgePancyclicity and Hamiltonian Laceability of the Balanced Hypercubes," Applied Math. and Computation, vol. 189, no. 2, pp. 13931401, 2007.