PAMPR: Power-aware and minimum path routing algorithm for NoCs
Mohammadreza Binesh Marvasti, Masoud Daneshtalab, Ali Afzali‐Kusha, Siamak Mohammadi · 2008
In this paper, a novel adaptive routing model for avoiding congested areas through utilization of an adaptive routing table in two-dimensional mesh on-chip networks is proposed. The routing path is determined by minimizing a cost function which considers the path length and power consumption of the neighbor cores. The cells of routing table are updated dynamically by a coefficient which is a function of the minimum path and power consumption of the neighbors. The experimental results show that in comparison to other routing schemes, the power-delay product of our routing algorithm performs better under the transpose and hotspot traffic profiles with low hardware overhead.