Hot Spot Minimization Of Noc Using Ant Net Dynamic Routing Algorithm | Zendy

Alireza Rahrooh | Zendy; Faramarz Mossayebi | Zendy; Walter W. Buchanan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Hot Spot Minimization Of Noc Using Ant Net Dynamic Routing Algorithm

Author(s) -

Alireza Rahrooh,

Faramarz Mossayebi,

Walter W. Buchanan

Publication year - 2020

Language(s) - English

Resource type - Conference proceedings

DOI - 10.18260/1-2--3186

Subject(s) - computer science , routing table , static routing , destination sequenced distance vector routing , link state routing protocol , algorithm , dynamic source routing , multipath routing , policy based routing , routing (electronic design automation) , hot spot (computer programming) , network packet , distributed computing , parallel computing , computer network , routing protocol

In this paper, a routing model for minimizing hot spots in the network on chip (NoC) is presented. The model makes use of AntNet routing algorithm which is based on Ant colony. Using this algorithm, which we call AntNet routing algorithm, heavy packet traffics are distributed on the chip minimizing the occurrence of hot spots. To evaluate the efficiency of the scheme, the proposed algorithm was compared to the XY, OddEven, and DyAD routing models. The simulation results show that in realistic (Transpose) traffic as well as in heavy packet traffic, the proposed model has less average delay and peak power compared to the other routing models. In addition, the maximum temperature in the proposed algorithm is less than those of the other routing algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research