
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChiChang Chen, Jianer Chen, "Optimal Parallel Routing in Star Networks," IEEE Transactions on Computers, vol. 46, no. 12, pp. 12931303, December, 1997.  
BibTex  x  
@article{ 10.1109/12.641930, author = {ChiChang Chen and Jianer Chen}, title = {Optimal Parallel Routing in Star Networks}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {12}, issn = {00189340}, year = {1997}, pages = {12931303}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.641930}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimal Parallel Routing in Star Networks IS  12 SN  00189340 SP1293 EP1303 EPD  12931303 A1  ChiChang Chen, A1  Jianer Chen, PY  1997 KW  Network routing KW  star network KW  parallel routing KW  partition matching KW  graph container KW  shortest path. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—Star networks have recently been proposed as attractive alternatives to the popular hypercube for interconnecting processors on a parallel computer. In this paper, we present an efficient algorithm that constructs an optimal parallel routing in star networks. Our result improves previous results for the problem.
[1] S.B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the nCube," Proc. Int'l Conf. Parallel Processing, pp. 393400, 1987.
[2] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[3] N. Bagherzadeh, M. Dowd, and S. Latifi, "A WellBehaved Enumeration of Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 5, pp. 531535, May 1995.
[4] N. Bagherzadeh, N. Nassif, and S. Latifi, “A Routing and Broadcasting Scheme on Faulty Star Graphs,” IEEE Trans. Computers, vol. 42, no. 11, pp. 1,3981,403, Nov. 1993.
[5] G. Birkhoff and S. MacLane, A Survey of Modern Algebra.New York: MacMillan, 1965.
[6] C.C. Chen, "Combinatorial and Algebraic Methods in Star and de Bruijn Networks," PhD dissertation, Dept. of Computer Science, Texas A&M Univ., 1995.
[7] C.C. Chen and J. Chen, "The Maximum Partition Matching Problem with Applications," SIAM J. Computing, to appear.
[8] C.C. Chen and J. Chen, "Optimal Parallel Routing in Star Graphs," Proc. 19th Int'l Workshop GraphTheoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 1197, pp. 7384, 1997.
[9] C.C. Chen and J. Chen, “Nearly Optimal OnetoMany Parallel Routing in Star Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 11961202, Dec. 1997.
[10] K. Day and A. Tripathi, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 3138, Jan. 1994.
[11] M. Dietzfelbinger, S. Madhavapeddy, and I.H. Sudborough, "Three disjoint path paradigms in star networks," Proc. Third IEEE Symp. Parallel and Distributed Processing, pp. 400406, 1991.
[12] Z. Galil and X. Yu, "Short Length Versions of Menger's Theorem," Proc. 27th Ann. ACM Symp. Theory of Computing, pp. 499508, 1995.
[13] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[14] S.W. Graham and S.R. Seidel, "The Cost of Broadcasting on Star Graphs and Kary Hypercubes," IEEE Trans. Computers, vol. 42, no. 6, pp. 756759, June 1993.
[15] D.F. Hsu, "On Container Width and Length in Graphs, Groups, and Networks," IEICE Trans. Fundamentals, vol. E77A, no. 4, pp. 668680, 1994.
[16] D.F. Hsu and T. Luczak, "On the kDiameter of kRegular kConnected Graphs," Discrete Mathematics, vol. 133, pp. 291296, 1994.
[17] J.S. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embeddings of Cycles and Grids in Star Graphs," Proc. Symp. Parallel and Distributed Processing, pp. 540547, 1990.
[18] J. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Characterization of node disjoint (parallel) paths in star graphs," Proc. Int'l Parallel Processing Symp., pp. 404409,Anaheim, Calif., 1991.
[19] K. Menger, "Zur allgemeinen kurventheorie," Fundamentals Math., vol. 10, pp. 96115, 1927.
[20] Z. Miller, D. Pritikin, I.H. Sudborough, "Near embeddings of hypercubes into Cayley graphs on the symmetric group," IEEE Trans. Computers, vol. 43, no. 1, pp. 1322, Jan. 1994.
[21] J. Misic and Z. Jovanovic, "Routing Function and Deadlock Avoidance in a Star Graph Interconnection Network," J. Parallel and Distributed Computing, vol. 22, pp. 216228, 1994.
[22] M. Nigam, S. Sahni, and B. Krishnamurthy, "Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs," Proc. Int'l Conf. Parallel Processing, pp. 340343, 1990.
[23] M. Palis, S. Rajasekaran, and D.S.L. Wei, “Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks,” J. Parallel and Distributed Computing, vol. 20, no. 2, pp. 145157, Feb. 1994.
[24] K. Qiu, S.G. Akl, and H. Meijer, "On Some Properties and Algorithms for the Star and Pancake Interconnection Networks," J. Parallel and Distributed Computing, vol. 22, pp. 1625, 1994.
[25] J.P. Sheu, C.T. Liaw, and T.S. Chen, “An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, June 1995.
[26] S. Sur and P.K. Srimani, "Topological Properties of Star Graphs," Computers and Math. Applications, vol. 25, pp. 8798, 1993.