Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.650099
Title: Dynamically reconfigurable network-on-chip
Author: Beldachi, Arash Farhadi
ISNI:       0000 0004 5355 3223
Awarding Body: University of Bristol
Current Institution: University of Bristol
Date of Award: 2014
Availability of Full Text:
Access from EThOS:
Abstract:
New Field Programmable Gate Arrays (FPGAs) are capable of implementing complete multi-core System-on-Chip (SoC) with the possibility of modifying the hardware configuration at run-time with Partial Dynamic Reconfiguration (PDR). The usage of a soft reconfigurable Network-on-Chip (NoC) to connect these cores is investigated in this thesis. At the architecture level a configurable router is proposed that supports dynamically reconfigurable networks. This router uses distributed routing for regular and irregular topologies and can vary the number of local ports and communication ports to build multi-dimensional networks with different topologies. The evaluation results show that the selection of the ideal router is different depending on traffic patterns and design objectives. Overall, the mesh network with a four local ports per router offers a higher level of performance with lower complexity compared to the traditional mesh with one local port per router. To complete this network architecture a routing algorithm is investigated capable of supporting topologies based on a variable number and size of innertorus 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 irregular global topologies which are also supported by the routing algorithm . This routing algorithm supports the addition of links to the mesh topology at run-time to reduce congestion depending on the application behaviour and resource availability. The proposed routing algorithm allows the insertion of links as requested by different parts of the application without centralised control. The analysis shows that despite this dynamic behaviour the routing algorithm remains deadlock free .
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.650099  DOI: Not available
Share: