HARAQ-Routing Table for On-Chip Congestion Control

N. Swethapriyanka*, G. Rajesh**
*-** Associate Professor, Department of ECE, Chadalawada Ramanamma Engineering College, Tirupathi, India.
Periodicity:January - March'2013
DOI : https://doi.org/10.26634/jwcn.1.4.2188

Abstract

When the Message latency increases in Networks-On-Chip Performance of the channel decreases due to congestion. In Mesh topology, minimal methods can distribute messages over two directions at each switch, but in high traffic loads this methods are inefficient. We present a non-minimal methods can overcome this blocking problem in high traffic loads and reduce the waiting time of messages by delivering them via alternative paths called HARAQ.To avoid creating cycles in network, the algorithm define all allowed turns including 180-degree turns on a single channel. To select a less congestion path from output channel to the destination region based on local and global information in the learning method.

Keywords

Congestion, Deadlock, Highly Adaptive Routing Algorithm, Latency, Live lock, Networks-on-chip.

How to Cite this Article?

Swethapriyanka, N., and Rajesh, G. (2013). Haraq-Routing Table For On-Chip Congestion Control, i-manager’s Journal on Wireless Communication Networks. 1(4), 5-11. https://doi.org/10.26634/jwcn.1.4.2188

References

[1]. HARAQ: Congestion-Aware Learning Model for Highly Adaptive Routing Algorithm in On-chip Network
[2]. M. Daneshtalab, et al., “Memory-Efficient On-Chip Network with Adaptive Interfaces”, IEEE Transaction on Computer-Aided Design of Integrated Circuits and Systems, Vol. 31, No. 1, pp. 146-159, Jan 2012.
[3]. M. Dehyadegari, et al., “An Adaptive Fuzzy Logic-based Routing Algorithm for Networks-on-Chip,” in Proceedings of 13th IEEE/NASAESA International Conference on Adaptive Hardware and Systems (AHS), pp. 208-214, 2011.
[4]. G. Ascia, et al., “Implementation and Analysis of a New Selection Strategy for Adaptive Routing in Networks-on-Chip,” IEEE Transaction on Computers, v.57, I.6, pp. 809-820, 2008.
[5]. P. Gratz, et al., “Regional Congestion Awareness for Load Balance in Networks-on-Chip,” in Proc. HPCA, pp. 203-214, 2008.
[6]. S. Ma, et al., “DBAR: an efficient routing algorithm to support multiple concurrent applications in networks-on-chip”, in Proc. of ISCA, 2011, pp.413-424.
[7]. F. Chaix, et al., “A fault-tolerant deadlock-free adaptive routing for On Chip interconnects,” in Proc. of DATE, pp. 1-4, 2011.
[8]. Z. Zhang, et al., “A reconfigurable routing algorithm for a fault-tolerant 2d-mesh network-on-chip”, in Proc. of DAC, 2008.
[9]. S. Jovanovic, C. Tanougast, et al., “A New Deadlock-Free Fault-Tolerant Routing Algorithm For NoC Interconnections”, in Proc. of FPLA, pp.326- 331, 2009.
[10]. J. Wu and D. Wang, “Fault-tolerant And Deadlock-free Routing in 2-D Meshes Using Rectilinear-Monotone Polygonal Fault Blocks”, in Proc. Of parallel Algorithms Appl., pp.99-111, 2005.
[11]. D. Fick, A. DeOrio, et al., “A Highly Resilient Routing Algorithm for FaultTolerant NoCs”, in Proc. of DATE, pp. 21-26, 2009.
[12]. C. Feng, ,et al. “A reconfigurable fault-tolerant deflection routing algorithm based on reinforcement learning for network-on-chip”, in Proc. of NoCArc, pp.11-16 , 2010.
[13]. K.P. Fan, C.T. King, “Turn Grouping for Multicast in Wormhole-Routed Mesh Networks Supporting the Turn Model”, Journal of Supercomputing, V.16, No.3, pp. 237-260, 2000.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.