ملخص
Many fully-adaptive algorithms have been proposed for k-ary n-cubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. This model requires a running time of O(1) which is the fastest model yet reported in the literature while maintaining reasonable accuracy.
| اللغة الأصلية | English |
|---|---|
| عنوان منشور المضيف | Proceedings of the ACM Symposium on Applied Computing |
| الصفحات | 835-839 |
| عدد الصفحات | 5 |
| حالة النشر | Published - 2002 |
| الحدث | Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid, Spain المدة: مارس ١١ ٢٠٠٢ → مارس ١٤ ٢٠٠٢ |
Other
| Other | Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing |
|---|---|
| الدولة/الإقليم | Spain |
| المدينة | Madrid |
| المدة | ٣/١١/٠٢ → ٣/١٤/٠٢ |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700???