ملخص
A model of adaptive routing in the hypercube has recently been proposed. Modelling adaptive routing in a high-radix k-ary n-cube, e.g., the torus, is more complicated than in the hypercube since a message in the former may cross more than one channel along a given dimension. This paper proposes a queuing model of adaptive routing in the torus. The validity of the model is demonstrated by comparing analytical results with those obtained through simulations.
| اللغة الأصلية | English |
|---|---|
| الصفحات (من إلى) | 1477-1487 |
| عدد الصفحات | 11 |
| دورية | Parallel Computing |
| مستوى الصوت | 25 |
| رقم الإصدار | 12 |
| المعرِّفات الرقمية للأشياء | |
| حالة النشر | Published - نوفمبر 1999 |
| منشور خارجيًا | نعم |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700.1712???
- ???subjectarea.asjc.2600.2614???
- ???subjectarea.asjc.1700.1708???
- ???subjectarea.asjc.1700.1705???
- ???subjectarea.asjc.1700.1704???
- ???subjectarea.asjc.1700.1702???