A comparative performance analysis of n-cubes and star graphs

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Kiasari, Abbas Eslami ^a,b   Sarbazi Azad, Hamid ^a,b  

^a INSTITUTE FOR STUDIES IN THEORETICAL PHYSICS AND MATHEMATICS IPM   (Iran)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; MATHEMATICAL MODELS; TELECOMMUNICATION TRAFFIC; VIRTUAL REALITY;

BISECTION BANDWIDTH; HYPERCUBE; TRAFFIC LOADS;

GRAPH THEORY;

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

References (15)

1. S. Abraham and K. Padmanabhan. Performance of the direct binary n-cube networks for multiprocessors. IEEE Transactions on Computers, 37(7):1000-1011, 1989.
2. S. Abraham and K. Padmanabhan. Performance of Multicomputer Networks under Pin-out Constraints. Journal of Parallel and Distributed Computing, 12(13):237-248, 1991.
3. A. Agarwal. Limits on interconnection network performance. IEEE Transactions on Parallel and Distributed Systems, 2(4):398-412, 1991.
4. S. B. Akers, D. Harel and B. Krishnamurthy. The Star Graph: An Attractive Alternative to the n-cube. Proceedings of International Conference on Parallel Processing, pages 393-400, 1987.
5. S. B. Akers and B. Krishnamurthy. A Group-Theoretic Model for Symmetric Interconnection Network. IEEE Transactions on Computers, 38(4): 555-565, 1989.
6. R. V. Boppana and S. Chalasani. A Comparison of Adaptive Wormhole Routing Algorithms. Proceedings of the 20th Annual International Symposium on Computer Architecture (ISCA'93), pages 351-360, 1993.
7. R. V. Boppana and S. Chalasani. A Framework for Designing Deadlock-Free Wormhole Routing Algorithms. IEEE Transactions on Parallel and Distributed Systems, 7(2):169-183, 1996.
8. Y. Boura, C. R. Das and T. M. Jacob. A performance model for adaptive routing in hypercubes. Proceedings of International Workshop on Parallel Processing, pages 11-16, 1994.
9. W. J. Dally. Performance Analysis of k-arry n-cubes Interconnection Networks. IEEE Transactions on Computers, C-39(6):775-785, 1990.
10. K. Day and A. Tripathi. A Comparative Study of Topological Properties of Hypercubes and Star Graphs. IEEE Transactions on Parallel and Distributed Systems, 5(1):31-38, 1994.
11. A. E. Kiasari, H. Sarbazi-Azad and M. Ould-Khaoua. Analytical Performance Modelling of Adaptive Wormhole Routing in the Star Interconnection Network. Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS'06), 2006.
12. A. E. Kiasari, H. Sarbazi-Azad and M. Rezazad. Performance Comparison of Adaptive Routing Algorithms in the Star Interconnection Network. Proceedings of the 8th International Conference on High Performance Computing in Asia Pacific Region (HPC-Asia'05), pages 257-264, 2005
13. J. V. Misic and Z. Jovanovic. Routing Function and Deadlock Avoidance in a Star Graph Interconnection Network. Journal of Parallel and Distributed Computing, 22(2):216-228, 1994.
14. S. Ponnuswamy and V. Chaudhary. A Comparative Study of Star graph and Rotator Graphs. International Conference on Parallel Processing, pages 46-50, 1994.
15. H. Sarbazi-Azad. Performance analysis of wormhole routing in multicomputer interconnection networks. PhD Thesis, Department of Computing Science, University of Glasgow, U.K., 2002.