Optimal parallel routing in star networks

IEEE Transactions on Computers

Volumn 46, Issue 12, 1997, Pages 1293-1303

  Chen, Chi Chang ^a   Chen, Jianer ^b  

^a TATUNG INSTITUTE OF TECHNOLOGY   (Taiwan)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Graph container; Network routing; Parallel routing; Partition matching; Shortest path; Star network

Indexed keywords

COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; ELECTRIC NETWORK TOPOLOGY; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; INTERCONNECTION NETWORKS; PARALLEL PROCESSING SYSTEMS;

HYPERCUBE; PARALLEL ROUTING; PARTITION MATCHING; STAR NETWORKS;

PARALLEL ALGORITHMS;

EID: 0031381430     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.641930     Document Type: Article

References (26)

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, pp. 555-565, 1989.
3. N. Bagherzadeh, M. Dowd, and S. Latifi, "A Well-Behaved Enumeration of Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 531-535, 1995.
4. N. Bagherzadeh, N. Nassif, and S. Latifi, "A Routing and Broadcasting Scheme on Faulty Star Graphs," IEEE Trans. Computers, vol. 42, pp. 1,398-1,403, 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. 1,196-1,202, 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, pp. 31-38, 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. San Francisco: 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, pp. 756-759, 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. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embedding of Cycles and Grides in Star Graphs," Proc. Second IEEE Symp. Parallel and Distributed Processing, pp. 540-547, 1991.
18. J. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Characteristics of Node Disjoint (Parallel) Path in Star Graphs," Proc. Fifth Int'l Parallel Processing Symp., pp. 404-409, 1991.
19. K. Menger, "Zur allgemeinen kurventheorie," Fundamentals Math., vol. 10, pp. 96-115, 1927.
20. Z. Miller, D. Pritikin, and I.H. Sudborough, "Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group," IEEE Trans. Computers, vol. 43, pp. 13-22, 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.A. Palis and S. Rajasekaran, "Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks," J. Parallel and Distributed Computing, vol. 20, pp. 145-157, 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. Sheu, C. Wu, and T. Chen, "An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 653-658, 1995.
26. S. Sur and P.K. Srimani, "Topological Properties of Star Graphs," Computers and Math. Applications, vol. 25, pp. 87-98, 1993.