Title: E-XY: an entropy based XY routing algorithm

Authors: Akash Punhani; Pardeep Kumar; Nitin

Addresses: Department of Computer Science and Engineering, Jaypee University of Information Technology, Solan, Himachal Pradesh, India ' Department of Computer Science and Engineering, Jaypee University of Information Technology, Solan, Himachal Pradesh, India ' CEAS-EECS, 812 A Rhodes Hall, University of Cincinnati, 2851 Woodside Drive, Cincinnati, OH, 45219, USA

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.

Keywords: routing algorithm; adaptive; parallel communication; router architecture; maximum entropy model.

DOI: 10.1504/IJGUC.2019.098222

International Journal of Grid and Utility Computing, 2019 Vol.10 No.2, pp.179 - 186

Available online: 19 Jan 2019 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article