Hot Spot Minimization Of Noc Using Ant Net Dynamic Routing Algorithm
- Conference
- Location
-
Pittsburgh, Pennsylvania
- Publication Date
-
June 22, 2008
- Start Date
-
June 22, 2008
- End Date
-
June 25, 2008
- ISSN
-
2153-5965
- Conference Session
- Tagged Division
-
Minorities in Engineering
- Page Count
-
10
- Page Numbers
-
13.669.1 - 13.669.10
- DOI
-
10.18260/1-2--3186
- Permanent URL
-
https://peer.asee.org/3186
- Download Count
-
381
Paper Authors
Alireza Rahrooh University of Central Florida
ALIREZA RAHROOH
Alireza Rahrooh is a Professor of Electrical Engineering Technology at the University of Central Florida. He received the B.S., M.S., and Ph.D. degrees in Electrical Engineering from the Univ. of Akron, in 1979, 1986, and 1990, respectively. His research interests include digital simulation, nonlinear dynamics, chaos, control theory, system identification and adaptive control. He is a member of ASEE, IEEE, Eta Kappa Nu, and Tau Beta Pi.
Faramarz Mossayebi Youngstown State University
FARAMARZ MOSSAYEBI
Faramarz Mossayebi is an Associate Professor in the Department of Electrical and Computer Engineering at Youngstown State University teaching in the area of digital systems including computer architecture and embedded systems, digital signal processing and controls. His primary area of interest includes modeling and simulation of nonlinear dynamical systems, digital signal processing, and control.
Walter Buchanan Texas A&M University
WALTER BUCHANAN
Walter W. Buchanan is Professor and Head of Engineering Technology & Ind. Distribution Department at Texas A&M University, TAMU. He received his BSE and MSE from Purdue University, and his Ph.D. and J.D. from Indiana University. Walt is a P.E. in five states, and is Chair of ETD. He has written over 90 papers, and is a Member of TAC of ABET and Chair of IEEE's Committee for Technology Accreditation Activities.
Abstract
NOTE: The first page of text has been automatically extracted and included below in lieu of an abstract
Hot Spot minimization of NoC Using AntNet 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.
1. Introduction The tile-based NoC architecture is known as a suitable solution for the communication problems in future VLSI circuits1. The routing algorithms could be classified as centralized versus distributed and static versus adaptive. In centralized algorithms, a central controller is responsible for updating the routing table for each node. The delay required for gathering the information regarding the network status and then broadcasting it to all nodes for updating their tables make the application of this type limited. Except for small size networks this method is only used in special cases. In distributed algorithms, the determination of the network status is distributed among the nodes which exchange information with each other. In static routing models, the path between the source and the destination of a packet is determined by the source and the destination themselves and the current traffic status of the network is not considered. In adaptive algorithms, however, the path between the source and the destination is determined node by node depending on the network status as the packet moves toward the destination. For example, DyAD2 is an adaptive routing algorithm and XY3 is a static routing algorithm in NOCs. In this work, we propose an adaptive distributed algorithm which distributes the packet traffic to minimize hot spots in the network. The algorithm which is inspired by ant colony is based on the AntNet routing algorithm4. The router is a short path adaptive router which selects the shortest path with the least traffic for sending the packet forward. The shortest paths which have the minimum number of hops5 form the sets of the minimum paths, and the router select the set with the minimum traffic to minimize hot spots which are nodes with high traffics. The paper is organized as follows. In Section 2, we briefly describe the AntNet algorithm while the proposed architecture is discussed in Section 3. The results are discussed in Section 4. Finally, the summery and conclusion are given in Section 5.
2. AntNet Routing Algorithm The routing model presented in this work is based on the AntNet algorithm4 which is for a network of computers. For the case of the hardware implementation for NoC, the algorithm should be modified. The control packets (ants) are used for updating the routing table based on the traffic status of the network. These control packets (ants)
Rahrooh, A., & Mossayebi, F., & Buchanan, W. (2008, June), Hot Spot Minimization Of Noc Using Ant Net Dynamic Routing Algorithm Paper presented at 2008 Annual Conference & Exposition, Pittsburgh, Pennsylvania. 10.18260/1-2--3186
ASEE holds the copyright on this document. It may be read by the public free of charge. Authors may archive their work on personal websites or in institutional repositories with the following citation: © 2008 American Society for Engineering Education. Other scholars may excerpt or quote from these materials with the same citation. When excerpting or quoting from Conference Proceedings, authors should, in addition to noting the ASEE copyright, list all the original authors and their institutions and name the host city of the conference. - Last updated April 1, 2015