All-to-all broadcasting in torus Network on Chip

Abderezak Touzene*, Khaled Day

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Citations (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.

Original languageEnglish
Pages (from-to)2585-2596
Number of pages12
JournalJournal of Supercomputing
Issue number7
Publication statusPublished - Jul 29 2015


  • 2D torus
  • All-to-all broadcasting
  • Network on chip (NoC)
  • Spanning trees

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture


Dive into the research topics of 'All-to-all broadcasting in torus Network on Chip'. Together they form a unique fingerprint.

Cite this