E-XY: an entropy based XY routing algorithm
by Akash Punhani; Pardeep Kumar; Nitin
International Journal of Grid and Utility Computing (IJGUC), Vol. 10, No. 2, 2019

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.

Online publication date: Sat, 19-Jan-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com