Asyncbtree: Revisiting binary tree topology for efficient FPGA-based noc implementation

Research output: Contribution to journalArticle

Abstract

Binary tree topology generally fails to attract network on chip (NoC) implementations due to its low bisection bandwidth. Fat trees are proposed to alleviate this issue by using increasingly thicker links to connect switches towards the root node. This scheme is very efficient in interconnected networks such as computer networks, which use generic switches for interconnection. In an NoC context, especially for field programmable gate arrays (FPGAs), fat trees require more complex switches as we move higher in the hierarchy. This restricts the maximum clock frequency at which the network operates and offsets the higher bandwidth achieved through using fatter links. In this paper, we discuss the implementation of a binary tree-based NoC, which achieves better bandwidth by varying the clock frequency between the switches as we move higher in the hierarchy. This scheme enables using simpler switch architecture, thus supporting higher maximum frequency of operation. The effect on bandwidth and resource requirement of this architecture is compared with other FPGA-based NoCs for different network sizes and traffic patterns.

Original languageEnglish
Article number7239858
JournalInternational Journal of Reconfigurable Computing
Volume2019
DOIs
Publication statusPublished - Jan 1 2019

Fingerprint

Binary trees
Field programmable gate arrays (FPGA)
Switches
Topology
Oils and fats
Bandwidth
Clocks
Computer networks
Telecommunication links
Network-on-chip

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

@article{1c979c958f354c749251d0b34bd68968,
title = "Asyncbtree: Revisiting binary tree topology for efficient FPGA-based noc implementation",
abstract = "Binary tree topology generally fails to attract network on chip (NoC) implementations due to its low bisection bandwidth. Fat trees are proposed to alleviate this issue by using increasingly thicker links to connect switches towards the root node. This scheme is very efficient in interconnected networks such as computer networks, which use generic switches for interconnection. In an NoC context, especially for field programmable gate arrays (FPGAs), fat trees require more complex switches as we move higher in the hierarchy. This restricts the maximum clock frequency at which the network operates and offsets the higher bandwidth achieved through using fatter links. In this paper, we discuss the implementation of a binary tree-based NoC, which achieves better bandwidth by varying the clock frequency between the switches as we move higher in the hierarchy. This scheme enables using simpler switch architecture, thus supporting higher maximum frequency of operation. The effect on bandwidth and resource requirement of this architecture is compared with other FPGA-based NoCs for different network sizes and traffic patterns.",
author = "Kizheppatt Vipin",
year = "2019",
month = "1",
day = "1",
doi = "10.1155/2019/7239858",
language = "English",
volume = "2019",
journal = "International Journal of Reconfigurable Computing",
issn = "1687-7195",
publisher = "Hindawi Publishing Corporation",

}

TY - JOUR

T1 - Asyncbtree

T2 - Revisiting binary tree topology for efficient FPGA-based noc implementation

AU - Vipin, Kizheppatt

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Binary tree topology generally fails to attract network on chip (NoC) implementations due to its low bisection bandwidth. Fat trees are proposed to alleviate this issue by using increasingly thicker links to connect switches towards the root node. This scheme is very efficient in interconnected networks such as computer networks, which use generic switches for interconnection. In an NoC context, especially for field programmable gate arrays (FPGAs), fat trees require more complex switches as we move higher in the hierarchy. This restricts the maximum clock frequency at which the network operates and offsets the higher bandwidth achieved through using fatter links. In this paper, we discuss the implementation of a binary tree-based NoC, which achieves better bandwidth by varying the clock frequency between the switches as we move higher in the hierarchy. This scheme enables using simpler switch architecture, thus supporting higher maximum frequency of operation. The effect on bandwidth and resource requirement of this architecture is compared with other FPGA-based NoCs for different network sizes and traffic patterns.

AB - Binary tree topology generally fails to attract network on chip (NoC) implementations due to its low bisection bandwidth. Fat trees are proposed to alleviate this issue by using increasingly thicker links to connect switches towards the root node. This scheme is very efficient in interconnected networks such as computer networks, which use generic switches for interconnection. In an NoC context, especially for field programmable gate arrays (FPGAs), fat trees require more complex switches as we move higher in the hierarchy. This restricts the maximum clock frequency at which the network operates and offsets the higher bandwidth achieved through using fatter links. In this paper, we discuss the implementation of a binary tree-based NoC, which achieves better bandwidth by varying the clock frequency between the switches as we move higher in the hierarchy. This scheme enables using simpler switch architecture, thus supporting higher maximum frequency of operation. The effect on bandwidth and resource requirement of this architecture is compared with other FPGA-based NoCs for different network sizes and traffic patterns.

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

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

U2 - 10.1155/2019/7239858

DO - 10.1155/2019/7239858

M3 - Article

AN - SCOPUS:85062624174

VL - 2019

JO - International Journal of Reconfigurable Computing

JF - International Journal of Reconfigurable Computing

SN - 1687-7195

M1 - 7239858

ER -