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

Research output: Contribution to journalArticle

8 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

Fingerprint

Routers
Time delay
Electric power utilization
Network-on-chip
Communication

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

Cite this

On all-to-all broadcast in dense gaussian network on-chip. / Touzene, Abderezak.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 26, No. 4, 6787056, 01.04.2015, p. 1085-1095.

Research output: Contribution to journalArticle

@article{7bca0a3bdaeb4c63b7e02a697a84ad02,
title = "On all-to-all broadcast in dense gaussian network on-chip",
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.",
keywords = "all-to-all broadcasting, Gaussian networks, Network-on-Chip (NoC), spanning trees",
author = "Abderezak Touzene",
year = "2015",
month = "4",
day = "1",
doi = "10.1109/TPDS.2014.2314689",
language = "English",
volume = "26",
pages = "1085--1095",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

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

AU - Touzene, Abderezak

PY - 2015/4/1

Y1 - 2015/4/1

N2 - 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.

AB - 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.

KW - all-to-all broadcasting

KW - Gaussian networks

KW - Network-on-Chip (NoC)

KW - spanning trees

UR - http://www.scopus.com/inward/record.url?scp=84925115368&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84925115368&partnerID=8YFLogxK

U2 - 10.1109/TPDS.2014.2314689

DO - 10.1109/TPDS.2014.2314689

M3 - Article

VL - 26

SP - 1085

EP - 1095

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 4

M1 - 6787056

ER -