ملخص
Analytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely been reported in the literature. Although many fully adaptive routing algorithms have been proposed to overcome the performance limitations of deterministic routing, there have been hardly any studies that describe analytical models for these algorithms. This paper proposes a new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato's algorithm [10]. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 1297-1304 |
عدد الصفحات | 8 |
دورية | IEEE Transactions on Computers |
مستوى الصوت | 48 |
رقم الإصدار | 12 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - ديسمبر 1999 |
منشور خارجيًا | نعم |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700.1712???
- ???subjectarea.asjc.2600.2614???
- ???subjectarea.asjc.1700.1708???
- ???subjectarea.asjc.1700.1703???