A new adaptive routing algorithm using partitioning scheme in x-Folded TM topology to avoid deadlock
by Mehrnaz Moudi; Mohamed Othman
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 28, No. 4, 2022

Abstract: A critical issue for interconnection networks is providing the shortest path without deadlock in each topology, and efficient routing algorithms are essential to avoid deadlock. In this paper, a new adaptive routing algorithm in x-Folded TM topology is presented. Using a partitioning scheme and admitting deadlock-free zones are the main factors in producing such an algorithm. The partitioning scheme exposes the relation of this routing to the x-Folded TM topology. To perform extensive simulation experiments, the traffic patterns and a wide range of injection rates are analysed. The simulation results show performance improvements when the performance is mainly dependent on the topology and the applied routing performance in each network. The efficiency of new adaptive routing to avoid deadlock in the x-Folded TM topology has been proven in this paper.

Online publication date: Mon, 04-Jul-2022

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 Communication Networks and Distributed Systems (IJCNDS):
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