2010
DOI: 10.1007/s11227-010-0454-7
|View full text |Cite
|
Sign up to set email alerts
|

Comparative analysis of Traffic Patterns on k-ary n-tree using adaptive algorithms based on Burton Normal Form

Abstract: k-ary n-trees are a particular type of Fat-Trees that belong to parametric family of topologies. In spite of their wide usage as an Interconnection Network topology, it has been quite unclear about the performance of Adaptive Routing Algorithms on them. In this paper, we consider a 4-ary 3-tree and analyze two Adaptive Routing Algorithms namely the Non-Minimal Adaptive Routing Algorithm and Minimal Adaptive Routing Algorithm. Specifically, the application of these algorithms on 4-ary 3-tree using various Traff… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
15
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
3
3

Relationship

2
4

Authors

Journals

citations
Cited by 21 publications
(15 citation statements)
references
References 15 publications
0
15
0
Order By: Relevance
“…With the performance requirement of the switches/routers exceeding several terabits/sec and teraflops/sec, it becomes imperative to make them dynamic and fault-tolerant. The typical modern day application of the MINs includes fault-tolerant packet switches, designing unicast, and multicast router fabrics [22][23][24][25][26][27][28][29][30][31][32][33]. [4][5][6][7].…”
Section: Interconnects-on-chip Architecturementioning
confidence: 99%
“…With the performance requirement of the switches/routers exceeding several terabits/sec and teraflops/sec, it becomes imperative to make them dynamic and fault-tolerant. The typical modern day application of the MINs includes fault-tolerant packet switches, designing unicast, and multicast router fabrics [22][23][24][25][26][27][28][29][30][31][32][33]. [4][5][6][7].…”
Section: Interconnects-on-chip Architecturementioning
confidence: 99%
“…Interconnection networks (IN) [1][2][3][4][5]29,[34][35][36][37][38][39][40][41][42][43][44][45][46][47][48][49] form a communication backbone for multiple processors fabricated on single chip or PCB [34][35][36][37][38]. Continual [1][2][3][4][5][6][7]29,[34][35][36][37][38][39][40][41][42][43][44][45][46][47][48][49], Optical Interconnection Networks (OIN), etc.…”
Section: Introductionmentioning
confidence: 99%
“…Continual [1][2][3][4][5][6][7]29,[34][35][36][37][38][39][40][41][42][43][44][45][46][47][48][49], Optical Interconnection Networks (OIN), etc. The MINs gained more popularity as they drastically reduce the hardware cost of implementation of communication backbone.…”
Section: Introductionmentioning
confidence: 99%
“…It connects inputs to outputs and is known as an MIN [1][2][3][4]. The parameter is called the size of the network.…”
Section: Introductionmentioning
confidence: 99%
“…MIN can be one-sided, where both inputs and outputs are on the same side, or it can be two-sided, where inputs and outputs are on the opposite side of the network. The two-sided MIN can be a rearrangeable, blocking and nonblocking network [4][5][6][7][8]. Although MIN is very popular in the field of parallel processing, in the present scenario with an increasing demand for bandwidth, an Optical Multi-stage Interconnection Network is used.…”
Section: Introductionmentioning
confidence: 99%