Methodology of searching for all shortest routes in NoC

• Main Authors: Nadezhda Matveeva, Elena Suvorova
• Format: Article
• Language: English
• Published: FRUCT 2012-11-01
• Series: Proceedings of the XXth Conference of Open Innovations Association FRUCT
• Subjects: Embedded networks; Network-on-chip (NoC); Adaptive routing; Shortest route; Network
• Online Access: https://www.fruct.org/publications/fruct12/files/Mat.pdf

Nowadays network technologies are broadly used in different areas of a human life. Data streams between network nodes are dramatically increasing. Systems-on-chip are evaluating very quickly and are used in many different areas of human life such as space, medicine and so on. Requirements to modern network hardware are increasing constantly. These requirements are: little size, big performance, many supported features and so on. Network-on-chip (NoC) plays very important role in a system-on-chip operation. It connects together all IP blocks, nodes of a system and provides data transmission. Therefore proper design of NoC increases its performance. Many modern NoCs support the adaptive routing mode. This mode assumes usage of several routes for specified pair source - destination. To improve network performance and decrease delays these routes must be the shortest. In this paper we offer an algorithm producing set of all shortest routes between source and destination for load balancing feature and performance increasing. In this paper the algorithm of the shortest noncyclical equal-length routes set building is offered.