This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Parallel Routing in Star Networks
December 1997 (vol. 46 no. 12)
pp. 1293-1303

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 n-Cube," Proc. Int'l Conf. Parallel Processing, pp. 393-400, 1987.
[2] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[3] N. Bagherzadeh, M. Dowd, and S. Latifi, "A Well-Behaved Enumeration of Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 5, pp. 531-535, 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,398-1,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 Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 1197, pp. 73-84, 1997.
[9] C.C. Chen and J. Chen, “Nearly Optimal One-to-Many Parallel Routing in Star Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 1196-1202, 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. 31-38, 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. 400-406, 1991.
[12] Z. Galil and X. Yu, "Short Length Versions of Menger's Theorem," Proc. 27th Ann. ACM Symp. Theory of Computing, pp. 499-508, 1995.
[13] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[14] S.W. Graham and S.R. Seidel, "The Cost of Broadcasting on Star Graphs and K-ary Hypercubes," IEEE Trans. Computers, vol. 42, no. 6, pp. 756-759, June 1993.
[15] D.F. Hsu, "On Container Width and Length in Graphs, Groups, and Networks," IEICE Trans. Fundamentals, vol. E77-A, no. 4, pp. 668-680, 1994.
[16] D.F. Hsu and T. Luczak, "On the k-Diameter of k-Regular k-Connected Graphs," Discrete Mathematics, vol. 133, pp. 291-296, 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. 540-547, 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. 404-409,Anaheim, Calif., 1991.
[19] K. Menger, "Zur allgemeinen kurventheorie," Fundamentals Math., vol. 10, pp. 96-115, 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. 13-22, 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. 216-228, 1994.
[22] M. Nigam, S. Sahni, and B. Krishnamurthy, "Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs," Proc. Int'l Conf. Parallel Processing, pp. 340-343, 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. 145-157, 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. 16-25, 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. 87-98, 1993.

Index Terms:
Network routing, star network, parallel routing, partition matching, graph container, shortest path.
Citation:
Chi-Chang Chen, Jianer Chen, "Optimal Parallel Routing in Star Networks," IEEE Transactions on Computers, vol. 46, no. 12, pp. 1293-1303, Dec. 1997, doi:10.1109/12.641930
Usage of this product signifies your acceptance of the Terms of Use.