Title: A new adaptive routing algorithm using partitioning scheme in x-Folded TM topology to avoid deadlock

Authors: Mehrnaz Moudi; Mohamed Othman

Addresses: Department of Computer and Electrical Engineering, University of Torbat Heydarieh, Razavi Khorasan Province, Iran ' Department of Communication Technology and Network, Universiti Putra Malaysia, 43400 UPM, Serdang, Selangor D.E., Malaysia

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.

Keywords: adaptive routing; partitioning scheme; x-Folded TM topology; deadlock.

DOI: 10.1504/IJCNDS.2022.123881

International Journal of Communication Networks and Distributed Systems, 2022 Vol.28 No.4, pp.476 - 497

Received: 06 Mar 2021
Accepted: 14 Jul 2021
Published online: 04 Jul 2022 *

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