All-to-all broadcasting in torus Network on Chip

Abderezak Touzene*, Khaled Day

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

نتاج البحث: المساهمة في مجلةمقالمراجعة النظراء

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

ملخص

This paper proposes and evaluates the performance of an all-to-all broadcasting algorithm for a 2D torus Network on Chip (NoC). The proposed algorithm uses special spanning trees called NEWS spanning trees. These trees are link conflict free which implies that the communication steps of the all-to-all algorithm are contention free. The proposed all-to-all broadcasting algorithm is optimal in terms of transmission time and does not need any additional buffer memory like in the all-to-all algorithm for the 2D torus (IEEE Trans Comput 50:1029–1032, 2001). Reducing the amount of buffer space is a very important issue in NoC architectures. Our algorithm is therefore a more efficient solution for all-to-all broadcasting in 2D torus NoC multi-core systems compared to previously proposed algorithms.

اللغة الأصليةEnglish
الصفحات (من إلى)2585-2596
عدد الصفحات12
دوريةJournal of Supercomputing
مستوى الصوت71
رقم الإصدار7
المعرِّفات الرقمية للأشياء
حالة النشرPublished - يوليو 29 2015

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1712???
  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.1700.1710???
  • ???subjectarea.asjc.1700.1708???

بصمة

أدرس بدقة موضوعات البحث “All-to-all broadcasting in torus Network on Chip'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا