Nearly optimal one-to-many parallel routing in star networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 12, 1997, Pages 1196-1202

  Chen, Chi Chang ^a   Chen, Jianer ^b  

^a TATUNG INSTITUTE OF TECHNOLOGY   (Taiwan)

^b Texas A and M University   (United States)

Author keywords

Interconnection network; Node disjoint paths; Parallel routing; Routing algorithm; Shortest path; Star network

Indexed keywords

EFFICIENCY; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL ALGORITHMS;

STAR NETWORKS;

COMPUTER NETWORKS;

EID: 0031342655     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.640011     Document Type: Article

References (21)

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, "The Fault Tolerance of Star Graphs," Proc. Second Int'l Conf. Supercomputing, pp. 270-276, 1987.
3. S.B. Akers and B. Krishnamurthy, "A Group-Theoretic Model for Symmetric Interconnection Networks," IEEE Trans. Computers, vol. 38, pp. 555-565, 1989.
4. G. Birkhoff and S. MacLane, A Survey of Modern Algebra. MacMillan, 1977.
5. C.C. Chen, "Combinatorial and Algebraic Methods in Star and de Bruijn Networks," PhD dissertation, Dept. of Computer Science, Texas A&M Univ., 1995.
6. C.C. Chen and J. Chen, "Vertex-Disjoint Routings in Star Graphs," Proc. First IEEE Int'l Conf. Algorithms and Architectures for Parallel Processing, pp. 460-464, 1995.
7. C.C. Chen and J. Chen, "Optimal Parallel Routing in Star Networks," IEEE Trans. Computers, to appear, vol. 46, no. 12, Dec. 1997.
8. C.C. Chen and J. Chen, "The Maximum Partition Matching Problem with Applications," SIAM J. Computing, to appear.
9. 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.
10. 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.
11. P. Fragopoulou and S.G. Akl, "Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance," IEEE Trans. Computers, vol. 45, pp. 174-185, 1996.
12. J. Hastad, F.T. Leighton, and M. Newman, "Fast Computation Using Fault Hypercubes," Proc. 21st ACM Symp. Theory of Computing, pp. 251-263, 1989.
13. J. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Characterization of Node Disjoint (Parallel) Path in Star Graphs," Proc. Fifth Int'l Parallel Processing Symp., pp. 404-409, 1991.
14. S. Madhavapeddy and I.H. Sudborough, "Deterministic Message Routing in Faulty Hypercubes," Lecture Notes in Computer Science 484, pp. 154-169, 1990.
15. K. Menger, "Zur allgemeinen kurventheorie," Fund. Math., vol. 10, pp. 96-115, 1927.
16. 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.
17. K. Qiu, S.G. Akl, and H. Meuer, "On Some Properties and Algorithms for the Star and Pancake Interconnection Networks," J. Parallel and Distributed Computing, vol. 22, pp. 16-25, 1994.
18. M.O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance," J. ACM, vol. 36, pp. 335-348, 1989.
19. Y. Saad and M.H. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, pp. 867-872, 1988.
20. 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.
21. S. Sur and P.K. Srimani, "Topological Properties of Star Graphs," Computers Math. Applications, vol. 25, pp. 87-98, 1993.