ملخص
Many adaptive routing algorithms for wormhole-routed k-ary n-cubes have been proposed to overcome the performance limitations of deterministic routing. However, before such routing schemes can be successfully incorporated in future practical multicomputers, it is necessary to develop a clear understanding of the factors that affect their potential performance. Boppanna and Chalasani have recently proposed a routing algorithm (referred to as hop-based routing) that achieves full adaptivity in wormhole-routed k-ary n-cubes using a hop-based scheme borrowed from traditional store-and forward networks. A new analytical model is prepared to compute message latency in k-ary n-cubes with hop-based routing. Results from simulation experiments reveal that the proposed model exhibits a good degree of accuracy in predicting message latency.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 89-94 |
عدد الصفحات | 6 |
دورية | IEE Proceedings: Computers and Digital Techniques |
مستوى الصوت | 148 |
رقم الإصدار | 2 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - مارس 2001 |
منشور خارجيًا | نعم |
ASJC Scopus subject areas
- ???subjectarea.asjc.2600.2614???
- ???subjectarea.asjc.1700.1708???
- ???subjectarea.asjc.1700.1703???