Reliable communication in faulty star networks

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 260-

  Day, K ^a   Al Ayyoub, A E ^b  

^a SULTAN QABOOS UNIVERSITY   (Oman)

^b JORDAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Jordan)

Author keywords

distributed algorithm; Fault tolerance; node disjoint paths; routing; star graph

Indexed keywords

EID: 64749093538     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1016687     Document Type: Conference Paper

References (24)

1. S. B. Akers and B. Krishnamurthy, "A Group-Theoretic Model for Symmetric Interconnection Networks," IEEE Trans. on Computers, vol. 38, no. 4, pp. 555-566, April 1989.
2. S. B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the n-Cube," in Proc. Int. Conf. Parallel Processing, 1987, pp. 393-400.
3. nd Int. Conf. Supercomputing, 1987, pp. 270-276.
4. A. Al-Ayyoub and K. Day, "Matrix Decomposition on the Star Graph", IEEE Trans. on Parallel and Distributed Systems, vol. 8, no. 8, pp. 803-812, August 1997.
5. N. Bagherzadeh, N. Nassif, and S. Latifi, "A Routing and Broadcasting Scheme in Faulty Star Graphs," IEEE Trans. on Computers, vol. 42, no. 11, pp. 1398-1403, November 1993.
6. P. Berthome, A. Ferreira and S.Perennes, "Optimal Information Dissemination in Star and Pancake Networks," IEEE Trans. on Parallel and Distributed Systems, vol. 7, no. 12, pp. 1292-1300, December 1996.
7. C. Chen and J. Chen, "Optimal Parallel Routing in Star Networks," IEEE Trans. on Computers, vol. 46, no. 12, pp. 1293-1303, December 1997.
8. C. Chen and J. Chen, "Nearly Optimal One-to-Many Parallel Routing in Star Networks," IEEE Trans. on Parallel and Distributed Systems, vol. 8, no. 12, pp. 1293-1303, December 1997.
9. K. Day and A. Tripathi, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," IEEE Trans. on Parallel and Distributed Systems, vol. 5, no. 1, pp. 31-38, January 1994.
10. M. Dietzfelbbinger, S. Madhavapeddy, and I.H. Sudborough, "Three disjoint path paradigms in star networks," Proc. IEEE Symp. Parallel and Distributed Processing, Dallas, 1991, pp. 400-406.
11. P. Fragopoulou, and S. G. Akl, "A Parallel Algorithm for Computing Fourier Transforms on the Star Graph," IEEE Trans. on Parallel and Distributed Systems, vol. 5, no. 5, pp. 525-531, May 1994.
12. L. Gargano, U. Vaccaro, and A. Vozella, "Fault-tolerant Routing in the Star and Pancake Interconnection Networks," Information Processing Letters, Vol. 45, Issue 6, pp. 315-320, April 1993.
13. S. W. Graham, and S. R. Seidel, "The Cost of Broadcasting on Star Graphs and K-ary Hypercubes," IEEE Transactions on Computers, vol. 42, no. 6, pp. 756-759, June 1993.
14. J. S. Jwo, S. Lakshmivarahan and S. K. Dhall, "Embedding of Cycles and Grids in Star Graphs," Journal of Circuits, Systems, and Computers, vol. 1, no. 1, pp. 43-74, 1991.
15. J. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Characterization of node-disjoint (parallel) paths in star graphs," Proc. Int'l Parallel Processing Symp., Anaheim, Calif., 1991, pp. 404-409.
16. S. Latifi, "On the Fault Diameter of the Star graph," IPL, vol. 46, pp. 143-150, 1993.
17. J. I. Lee and J. H. Chang, "Embedding Complete Binary Trees in Star Graphs," Journal of the Korea Information Science Society, vol. 21, no. 2, pp. 407-415, February 1994.
18. A. Menn and A. K. Somani, "An Efficient Sorting Algorithm for the Star Graph Interconnection Network," Proc. Intl. Conf. Parallel Processing, 1990, pp. 1-8.
19. M. Nigam, S. Sahni and B. Krishnamurthy, "Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs," Proc. Intl. Conf. Parallel Processing, 1990, pp. 340-343.
20. S. Rajasekaran, and D. S. L. Wei, "Selection, Routing, and Sorting on the Star Graph," in the Proceedings of the Seventh International Parallel Processing Symposium, 1993, pp. 661-665.
21. S. Ranka, J. C. Wang and N. Yeh, "Embedding Meshes on the Star Graph," Journal of Parallel and Distributed Computing, vol. 19, no. 2, pp. 131-135, October 1993.
22. Y. Rouskov and P. K. Srimani, "Fault Diameter of Star Graphs," IPL, vol. 48, pp. 243-251, 1993.
23. J. P. Sheu, W. H. Liaw, and T. S. Chen, "A Broadcasting Algorithm in Star Graph Interconnection Networks," Information Processing Letters, vol. 48, no. 5, pp. 237-241, December 1993.
24. S. Sur and P. K. Srimani, "A Fault-tolerant Routing Algorithm in Star Graph Interconnection Networks," in Proc. Int. Conf. Parallel Processing, vol. 3, 1991, pp. 267-270.