Comparative Analysis of Routing Algorithms in Wormhole Cube Networks

M. Ould-Khaoua*, S. Loucif, A. Al-Dhelaan

*المؤلف المقابل لهذا العمل

نتاج البحث: Conference contribution

ملخص

There have been many adaptive routing algorithms proposed in the literature for wormhole-routed networks. This paper compares the performance of deterministic routing to two adaptive routing algorithms in the cube network. The comparison takes into account router delays introduced by adaptivity. The results show that in certain circumstances, deterministic routing can outperform adaptive routing.

اللغة الأصليةEnglish
عنوان منشور المضيفProceedings of the Joint Conference on Information Sciences
المحررونK. Li, Y. Pan, P.P. Wang, A. Al-Dhelaan, H. Da Cheng, Y. Pan, P.P. Wang, K. Li, A. Al-Dhelaan, H. Da Cheng
الصفحات94-97
عدد الصفحات4
مستوى الصوت4
حالة النشرPublished - 1998
الحدث4th International Conference on Computer Science and Informatics, JCIS 1998, 1st International Workshop on High Performance, 1st International Workshop on Computer Vision, Pattern Recognition and Image Processing Volume 4 - Research Triangle Park, NC, United States
المدة: أكتوبر ٢٣ ١٩٩٨أكتوبر ٢٨ ١٩٩٨

Other

Other4th International Conference on Computer Science and Informatics, JCIS 1998, 1st International Workshop on High Performance, 1st International Workshop on Computer Vision, Pattern Recognition and Image Processing Volume 4
الدولة/الإقليمUnited States
المدينةResearch Triangle Park, NC
المدة١٠/٢٣/٩٨١٠/٢٨/٩٨

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1700???

بصمة

أدرس بدقة موضوعات البحث “Comparative Analysis of Routing Algorithms in Wormhole Cube Networks'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا