الگوريتم مسيريابي براي شبكه هاي روي تراشه بر اساس محاسبه ازدحام

CONGESTION AVOIDANCE ROUTING ALGORITHM for NETWORK ON CHIP (CANOC)

— Providing an economic congestion control is a big challenge in network on chip (NOC) design. there is not a serious research in congestion area in NOC routing protocols. Lots of them previous works are based on hardware modification or solutions inherited from off-chip networks. Whenever congestion awareness is required , using the adaptive routing algorithms is considered .certainly these types of routing algorithms with congestion awareness capabilities can lead to hardware cost. In this paper , we present a solution to detect a congestion based on throughput and round trip time gradient proactively and then implement it to routing algorithm .this solution is transparent from hardware or software design and in comparison to previous solutions(XY,ODD-EVEN,DYXY) is much more cost effective and flexible to be implemented and our simulation with Nirgam 2.1 approves latency, throughput and power improvement in comparison to XY,ODD-EVEN (OE) and DYXY routing algorithms

— Providing an economic congestion control is a big challenge in network on chip (NOC) design. there is not a serious research in congestion area in NOC routing protocols. Lots of them previous works are based on hardware modification or solutions inherited from off-chip networks. Whenever congestion awareness is required , using the adaptive routing algorithms is considered .certainly these types of routing algorithms with congestion awareness capabilities can lead to hardware cost. In this paper , we present a solution to detect a congestion based on throughput and round trip time gradient proactively and then implement it to routing algorithm .this solution is transparent from hardware or software design and in comparison to previous solutions(XY,ODD-EVEN,DYXY) is much more cost effective and flexible to be implemented and our simulation with Nirgam 2.1 approves latency, throughput and power improvement in comparison to XY,ODD-EVEN (OE) and DYXY routing algorithms