On all-to-all broadcast in dense gaussian network on-chip

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Gaussian networks are gaining popularity as good candidates Network On-Chip (NoC) for interconnecting Multiprocessor System-on-Chips (MPSoCs). They showed better topological properties compared to the 2D torus networks with the same number of nodes N and the same degree 4. All-to-all broadcast is a collective communication algorithm used frequently in many parallel applications. Recently, Z. Zhang et al. [1] have proposed an all-to-all broadcast algorithm for Gaussian on-chip networks that achieves the minimum delay time but requires 4k extra buffers per router, where k is the network diameter. In this paper, we propose a new all-to-all broadcast algorithm for dense Gaussian on-chip networks that achieves the minimum delay time without requiring any extra buffers per router. In this paper, we propose a new all-to-all broadcast algorithm for dense Gaussian on-chip networks that achieves the minimum delay time without requiring any extra buffers per router. Along with low latency, reducing the amount of buffer space and power consumption are very important issues in NoCs architectures.

Original languageEnglish
Article number6787056
Pages (from-to)1085-1095
Number of pages11
JournalIEEE Transactions on Parallel and Distributed Systems
Volume26
Issue number4
DOIs
Publication statusPublished - Apr 1 2015

Keywords

  • all-to-all broadcasting
  • Gaussian networks
  • Network-on-Chip (NoC)
  • spanning trees

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'On all-to-all broadcast in dense gaussian network on-chip'. Together they form a unique fingerprint.

  • Cite this