A novel routing algorithm for on-chip communication in NoC on diametrical 2D mesh interconnection architecture
P Ghosal, TS Das - Advances in Computing and Information Technology …, 2013 - Springer
P Ghosal, TS Das
Advances in Computing and Information Technology: Proceedings of the Second …, 2013•SpringerTo meet the design productivity, scalability and signal integrity challenges of next-generation
system designs, a structured and scalable interconnection architecture, network on chip
(NoC), has been proposed recently to solve the complex on-chip communication problem. In
an NoC, the communication among different nodes is achieved by routing packets through a
pre-designed network fabric according to some architecture rather than wires. In Diametrical
2D Mesh architecture, advantages of routing include smaller network diameter as well as …
system designs, a structured and scalable interconnection architecture, network on chip
(NoC), has been proposed recently to solve the complex on-chip communication problem. In
an NoC, the communication among different nodes is achieved by routing packets through a
pre-designed network fabric according to some architecture rather than wires. In Diametrical
2D Mesh architecture, advantages of routing include smaller network diameter as well as …
Abstract
To meet the design productivity, scalability and signal integrity challenges of next-generation system designs, a structured and scalable interconnection architecture, network on chip (NoC), has been proposed recently to solve the complex on-chip communication problem. In an NoC, the communication among different nodes is achieved by routing packets through a pre-designed network fabric according to some architecture rather than wires. In Diametrical 2D Mesh architecture, advantages of routing include smaller network diameter as well as larger bisection width. Again, fast network access requires a well-constructed optimal routing algorithm. Our proposed routing algorithm ensures that the packet will always reach the destination through the shortest path and it is deadlock free.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果