A simple mathematical model of adaptive routing in wormhole k-ary n-cubes

H. Sarbazi-Azad*, M. Ould-Khaoua

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

نتاج البحث

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

ملخص

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
المدة: مارس ١١ ٢٠٠٢مارس ١٤ ٢٠٠٢

Other

OtherApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing
الدولة/الإقليمSpain
المدينةMadrid
المدة٣/١١/٠٢٣/١٤/٠٢

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700???

بصمة

أدرس بدقة موضوعات البحث “A simple mathematical model of adaptive routing in wormhole k-ary n-cubes'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا