Title

Hot Spot Minimization Of Noc Using Ant-Net Dynamic Routing Algorithm

Abstract

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, Odd-Even, 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. © American Society for Engineering Education, 2008.

Publication Date

1-1-2008

Publication Title

ASEE Annual Conference and Exposition, Conference Proceedings

Number of Pages

-

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

85081504578 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/85081504578

This document is currently not available here.

Share

COinS