ملخص
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
| Other | 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 |
|---|---|
| الدولة/الإقليم | United States |
| المدينة | Research Triangle Park, NC |
| المدة | ١٠/٢٣/٩٨ → ١٠/٢٨/٩٨ |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700???