All-To-All Broadcast in Hexagonal Torus Networks On-Chip

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Hexagonal torus networks are special family of Eisenstein-Jacobi (EJ) networks which have gained popularity as goodcandidates 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. All-to-all broadcast is a collective communicationalgorithm used frequently in some parallel applications. Recently, an off-chip all-to-all broadcast algorithm has been proposed forhexagonal torus networks assuming half-duplex links and all-ports communication. The proposed all-to-all broadcast algorithm does not achieve the minimum transmission time and requires 24 k extra buffers, where k is the network diameter. We first extend this work by proposing an efficient all-to-all broadcast on hexagonal torus networks under full-duplex links and all-ports communications assumptions which achieves the minimum transmission delay but requires 36 k extra buffers per router. In a second stage, we develop a new all-to-all broadcast more suitable for hexagonal torus network on-chip that achieves optimal transmission delay time without requiring any extra buffers per router. By reducing the amount of buffer space, the new all-to-all broadcast reduces the routers cost which is an important issue in NoCs architectures.

Original languageEnglish
Article number6881698
Pages (from-to)2410-2420
Number of pages11
JournalIEEE Transactions on Parallel and Distributed Systems
Volume26
Issue number9
DOIs
Publication statusPublished - Sep 1 2015

Fingerprint

Routers
Communication
Time delay
Network-on-chip
Costs

Keywords

  • all-to-all broadcast
  • Eisenstein-Jacobi networks
  • hexagonal mesh
  • Network-on-Chip (NoC)
  • spanning trees

ASJC Scopus subject areas

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

Cite this

All-To-All Broadcast in Hexagonal Torus Networks On-Chip. / Touzene, Abderezak.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 26, No. 9, 6881698, 01.09.2015, p. 2410-2420.

Research output: Contribution to journalArticle

@article{723d6efb976e469285c905511dbbc824,
title = "All-To-All Broadcast in Hexagonal Torus Networks On-Chip",
abstract = "Hexagonal torus networks are special family of Eisenstein-Jacobi (EJ) networks which have gained popularity as goodcandidates 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. All-to-all broadcast is a collective communicationalgorithm used frequently in some parallel applications. Recently, an off-chip all-to-all broadcast algorithm has been proposed forhexagonal torus networks assuming half-duplex links and all-ports communication. The proposed all-to-all broadcast algorithm does not achieve the minimum transmission time and requires 24 k extra buffers, where k is the network diameter. We first extend this work by proposing an efficient all-to-all broadcast on hexagonal torus networks under full-duplex links and all-ports communications assumptions which achieves the minimum transmission delay but requires 36 k extra buffers per router. In a second stage, we develop a new all-to-all broadcast more suitable for hexagonal torus network on-chip that achieves optimal transmission delay time without requiring any extra buffers per router. By reducing the amount of buffer space, the new all-to-all broadcast reduces the routers cost which is an important issue in NoCs architectures.",
keywords = "all-to-all broadcast, Eisenstein-Jacobi networks, hexagonal mesh, Network-on-Chip (NoC), spanning trees",
author = "Abderezak Touzene",
year = "2015",
month = "9",
day = "1",
doi = "10.1109/TPDS.2014.2346200",
language = "English",
volume = "26",
pages = "2410--2420",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "9",

}

TY - JOUR

T1 - All-To-All Broadcast in Hexagonal Torus Networks On-Chip

AU - Touzene, Abderezak

PY - 2015/9/1

Y1 - 2015/9/1

N2 - Hexagonal torus networks are special family of Eisenstein-Jacobi (EJ) networks which have gained popularity as goodcandidates 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. All-to-all broadcast is a collective communicationalgorithm used frequently in some parallel applications. Recently, an off-chip all-to-all broadcast algorithm has been proposed forhexagonal torus networks assuming half-duplex links and all-ports communication. The proposed all-to-all broadcast algorithm does not achieve the minimum transmission time and requires 24 k extra buffers, where k is the network diameter. We first extend this work by proposing an efficient all-to-all broadcast on hexagonal torus networks under full-duplex links and all-ports communications assumptions which achieves the minimum transmission delay but requires 36 k extra buffers per router. In a second stage, we develop a new all-to-all broadcast more suitable for hexagonal torus network on-chip that achieves optimal transmission delay time without requiring any extra buffers per router. By reducing the amount of buffer space, the new all-to-all broadcast reduces the routers cost which is an important issue in NoCs architectures.

AB - Hexagonal torus networks are special family of Eisenstein-Jacobi (EJ) networks which have gained popularity as goodcandidates 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. All-to-all broadcast is a collective communicationalgorithm used frequently in some parallel applications. Recently, an off-chip all-to-all broadcast algorithm has been proposed forhexagonal torus networks assuming half-duplex links and all-ports communication. The proposed all-to-all broadcast algorithm does not achieve the minimum transmission time and requires 24 k extra buffers, where k is the network diameter. We first extend this work by proposing an efficient all-to-all broadcast on hexagonal torus networks under full-duplex links and all-ports communications assumptions which achieves the minimum transmission delay but requires 36 k extra buffers per router. In a second stage, we develop a new all-to-all broadcast more suitable for hexagonal torus network on-chip that achieves optimal transmission delay time without requiring any extra buffers per router. By reducing the amount of buffer space, the new all-to-all broadcast reduces the routers cost which is an important issue in NoCs architectures.

KW - all-to-all broadcast

KW - Eisenstein-Jacobi networks

KW - hexagonal mesh

KW - Network-on-Chip (NoC)

KW - spanning trees

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

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

U2 - 10.1109/TPDS.2014.2346200

DO - 10.1109/TPDS.2014.2346200

M3 - Article

VL - 26

SP - 2410

EP - 2420

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 9

M1 - 6881698

ER -