eXtended Torus routing algorithm for networks-onchip: A routing algorithm for dynamically reconfigurable networks-on-chip

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

This paper presents a novel routing algorithm called eXtended Torus routing algorithm for networks-on-chip (XTRANC) which supports topologyies based on a variable number and size of inner-torus building blocks. The inner-tori partition a traditional mesh network into an arbitrary number of sub-networks to increase the mesh performance. The subnetworks can generate non-regular global topologies which are also supported by the XTRANC algorithm. XTRANC is especially suitable for dynamically reconfigurable networks mapped to commercial FPGAs in which additional links are added to the mesh topology at run-time to reduce congestion depending on application behaviour and resource availability. XTRANC allows the insertion of links as requested by different parts of the application without centralized control and this research shows that despite this dynamic behaviour the routing algorithm remains deadlock free. © The Institution of Engineering and Technology 2014.

Cite

CITATION STYLE

APA

Beldachi, A. F., Hollis, S., & Nunez-Yanez, J. L. (2014). eXtended Torus routing algorithm for networks-onchip: A routing algorithm for dynamically reconfigurable networks-on-chip. IET Circuits, Devices and Systems, 8(3), 148–162. https://doi.org/10.1049/iet-cdt.2013.0087

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free