The Journal of Supercomputing

, Volume 59, Issue 2, pp 569–588

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

Article

DOI: 10.1007/s11227-010-0454-7

Cite this article as:
Nitin & Chauhan, D.S. J Supercomput (2012) 59: 569. doi:10.1007/s11227-010-0454-7
  • 127 Views

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.

Keywords

Index TermsInterconnection networksFat-treesk-ary n-treesTraffic PatternsNon-Minimal Adaptive RoutingMinimal Adaptive RoutingBigNetSimBurton Normal FormCongestion-free patterns and flow-control

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of CSE and ITJaypee University of Information TechnologySolanIndia
  2. 2.Uttarakhand Technical UniversityDehradunIndia