On the performance of routing algorithms in wormhole-switched multicomputer networks

A. Shahrabi*, M. Ould-Khaoua

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

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

3 اقتباسات (Scopus)

ملخص

This paper presents a comparative performance study of adaptive and deterministic routing algorithms in wormhole-switched hypercubes and investigates the performance vicissitudes of these routing schemes under a variety of network operating conditions. Despite the previously reported results, our results show that the adaptive routing does not consistently outperform the deterministic routing even for high dimensional networks. In fact, it appears that the superiority of adaptive routing is highly dependent to the broadcast traffic rate generated at each node and it begins to deteriorate by growing the broadcast rate of generated message.

اللغة الأصليةEnglish
عنوان منشور المضيفProceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
المحررونJ. Ma, L.T. Yang
الصفحات515-519
عدد الصفحات5
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 2005
منشور خارجيًانعم
الحدث11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005 - Fukuoka, Japan
المدة: يوليو ٢٠ ٢٠٠٥يوليو ٢٢ ٢٠٠٥

سلسلة المنشورات

الاسمProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
مستوى الصوت2
رقم المعيار الدولي للدوريات (المطبوع)1521-9097

Other

Other11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
الدولة/الإقليمJapan
المدينةFukuoka
المدة٧/٢٠/٠٥٧/٢٢/٠٥

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1708???

بصمة

أدرس بدقة موضوعات البحث “On the performance of routing algorithms in wormhole-switched multicomputer networks'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا