Hypercube versus torus under pin-out constraint and finite buffers

N. Alzeidi*, M. Ould-Khaoua, J. Ferguson

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

نتاج البحث

ملخص

Previous studies have shown that when the network is subject to the pin-out constraint, the network topology exhibiting the best performance depends on the network size. These studies have assumed single flit buffers. Deploying finite size buffers, however, may add extra complexity to the router design and hence will influence the cost and the performance of the network. This paper reinvestigates analytically the relative performance merits of different k-sry n-cube topologies combining wormhole switching, adaptive routing, multiple virtual channels and finite size buffers. The results reveal new insights demonstrating the sensitivity of these studies to the level of detail and realism incorporated in the analysis.

اللغة الأصليةEnglish
عنوان منشور المضيفICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications
الصفحات544-547
عدد الصفحات4
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 2007
الحدث2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007 - Dubai
المدة: نوفمبر ١٤ ٢٠٠٧نوفمبر ٢٧ ٢٠٠٧

سلسلة المنشورات

الاسمICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications

Other

Other2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007
الدولة/الإقليمUnited Arab Emirates
المدينةDubai
المدة١١/١٤/٠٧١١/٢٧/٠٧

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1705???
  • ???subjectarea.asjc.1700.1711???
  • ???subjectarea.asjc.3300.3315???

بصمة

أدرس بدقة موضوعات البحث “Hypercube versus torus under pin-out constraint and finite buffers'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا