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

Authors:
Nitin;Durg Singh Chauhan
Affiliations:
Department of CSE and IT, Jaypee University of Information Technology, Solan, India 173234;Uttarakhand Technical University, Dehradun, India 248001
Venue:
The Journal of Supercomputing
Year:
2012

Citing 16
Cited 3

A transputer network for fast operations on digitised images

Computer Graphics Forum
A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approach

Journal of Parallel and Distributed Computing
Network and processor architecture for message-driven computers

VLSI and parallel computation
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
CHARM++: a portable concurrent object oriented system based on C++

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
The Case for Chaotic Adaptive Routing

IEEE Transactions on Computers
Parallel Edge-Region-Based Segmentation Algorithm Targeted at Reconfigurable MultiRing Network

The Journal of Supercomputing
k -ary n -trees: High Performance Networks for Massively Parallel Architectures

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Performance Analysis of a Minimal Adaptive Router

PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
Adaptive channel queue routing on k-ary n-cubes

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Performance Prediction Using Simulation of Large-Scale Interconnection Networks in POSE

Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
Scaling an optimistic parallel simulation of large-scale interconnection networks

WSC '05 Proceedings of the 37th conference on Winter simulation
Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties

Journal of Discrete Algorithms
Designing a Fault-tolerant Fully-Chained Combining Switches Multi-stage Interconnection Network with Disjoint Paths

The Journal of Supercomputing
An efficient fault-tolerant routing methodology for fat-tree interconnection networks

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Stochastic communication for application-specific Networks-on-Chip

The Journal of Supercomputing
On a deadlock and performance analysis of ALBR and DAR algorithm on X-Torus topology by optimal utilization of Cross Links and minimal lookups

The Journal of Supercomputing
Message broadcasting via a new fault tolerant irregular advance omega network in faulty and nonfaulty network environments

Journal of Electrical and Computer Engineering

Quantified Score

Hi-index	0.01

Visualization

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 Traffic Patterns has been simulated. The six Traffic Patterns called BitTranspose, BitReversal, BitComplement, Uniform Distribution, k-shift and Ring are used as running examples throughout the paper. The simulation results show that the Network Latency for k-ary n-tree is much higher in case of the Non-Minimal Algorithm as compared to the Minimal Algorithm. However, in case of Ring Traffic, the results show a deviant behavior when compared to other patterns.