HARAQ: Congestion-Aware Learning Model for Highly Adaptive Routing Algorithm in On-Chip Networks
- 1 May 2012
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The occurrence of congestion in on-chip networks can severely degrade the performance due to increased message latency. In mesh topology, minimal methods can propagate messages over two directions at each switch. When shortest paths are congested, sending more messages through them can deteriorate the congestion condition considerably. In this paper, we present an adaptive routing algorithm for on-chip networks that provide a wide range of alternative paths between each pair of source and destination switches. Initially, the algorithm determines all permitted turns in the network including 180-degree turns on a single channel without creating cycles. The implementation of the algorithm provides the best usage of all allowable turns to route messages more adaptively in the network. On top of that, for selecting a less congested path, an optimized and scalable learning method is utilized. The learning method is based on local and global congestion information and can estimate the latency from each output channel to the destination region.Keywords
This publication has 21 references indexed in Scilit:
- Adaptive Input-Output Selection Based On-Chip Router ArchitectureJournal of Low Power Electronics, 2012
- An adaptive fuzzy logic-based routing algorithm for networks-on-chipPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Managing Wire Delay in Large Chip-Multiprocessor CachesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Multifacet's general execution-driven multiprocessor simulator (GEMS) toolsetACM SIGARCH Computer Architecture News, 2005
- An Approach to Tune Fuzzy Controllers Based on Reinforcement Learning for Autonomous Vehicle ControlIEEE Transactions on Intelligent Transportation Systems, 2005
- Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocksInternational Journal of Parallel, Emergent and Distributed Systems, 2005
- Packet Routing in Dynamically Changing Networks on ChipPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The SPLASH-2 programs: characterization and methodological considerationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Q-learningMachine Learning, 1992
- Planar-adaptive routingPublished by Association for Computing Machinery (ACM) ,1992