Paper Info
Title
E-Xy: An Entropy Based Xy Routing Algorithm
Abstract
In recent years, Network on Chip (NoC) is used to handle the communication issues between cores or processing elements. The major drawback of existing XY routing algorithm for mesh topology is its inability to handle a high traffic load. In this paper, an E-XY (Entropy based XY) routing algorithm is proposed to generate information about the adjacent router based on previously communicated packets. Tests have been carried out on a mesh topology of 8x8 simulated using Omnet++ 4.4.1 using HNOCS version. Different types of traffic have been considered for result computation including uniform, bit complement, neighbour and tornado. The proposed algorithm is compared with other routing algorithms including XY, IX/Y and Odd Even. Results demonstrate that the proposed algorithm is comparable to XY routing algorithm up to the load factor of 0.8 and performs well than the XY, IX/Y and Odd Even routing algorithms with the increase in load.
Year
DOI
Venue
2019
10.1504/IJGUC.2019.098222
INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING
Keywords
Field
DocType
routing algorithm, adaptive, parallel communication, router architecture, maximum entropy model
Mesh networking,Topology,Computer science,Load factor,Parallel communication,Network packet,Network on a chip,Principle of maximum entropy,Router,Distributed computing,Computation
Journal
Volume
Issue
ISSN
10
2
1741-847X
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Akash Punhani102.70
Pardeep Kumar224324.38
Nitin310016.37