Abstract
To solve the challenges in the field of integrated circuits (IC) or system-on-chip (SoC) design, network-on-chip (NoC) has been recognized as a core concept. A routing algorithm is one of the key research among all the aspects NoC relates. Therefore, finding an optimal routing algorithm can help enhance the networks performance, reduce latency, increase scalability, decrease power consumption, limit expenditure, and so on. Due to its importance, we delve deeper into the area of routing algorithms for NoC designs. In this paper, we will review and summarize three mesh-based adaptive routing algorithms used for NoC, and provide a simple comparison and evaluation between these algorithms. Specifically, Neighboron-path (NoP) is used as the fundamental algorithm in our paper. Then the two advanced routing algorithms, regional ant colony optimization-based cascaded adaptive routing (RACO-CAR) and destination-based selection strategy (DBSS), will be analyzed and compared with NoP.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call