<abstract xmlns="http://www.w3.org/1999/xhtml"><p>The performance of the interconnection network doesn’t only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing algorithm for the mesh topology in networks on chip is the XY Routing algorithm. The level based Routing algorithm has been proved to be more efficient than the XY Routing algorithm. In this paper, level based Routing algorithm using the dynamic programming has been proposed. The proposed Routing algorithm proves to be more efficient in the terms of the computation. The proposed Routing algorithm has achieved up to two times bigger speed.</p></abstract>

The performance of the interconnection network doesn’t only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing algorithm for the mesh topology in networks on chip is the XY Routing algorithm. The level based Routing algorithm has been proved to be more efficient than the XY Routing algorithm. In this paper, level based Routing algorithm using the dynamic programming has been proposed. The proposed Routing algorithm proves to be more efficient in the terms of the computation. The proposed Routing algorithm has achieved up to two times bigger speed.

Level Based Routing Using Dynamic Programming for 2D Mesh

Jaypee University of Information Technology

Jaypee Institute of Information Technology

Cybernetics and Information Technologies

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Level Based Routing Using Dynamic Programming for 2D Mesh"}

The performance of the interconnection network doesn’t only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing...

Level Based Routing Using Dynamic Programming for 2D Mesh

Data publikacji: 26 cze 2017

Zakres stron: 73 - 82

DOI: https://doi.org/10.1515/cait-2017-0017

Słowa kluczowe
Dynamic programming, Routing algorithm, Mesh topology, Time complexity, Space complexity

© 2017 Akash Punhani et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Level Based Routing Using Dynamic Programming for 2D Mesh

Data publikacji: 26 cze 2017

Zakres stron: 73 - 82

DOI: https://doi.org/10.1515/cait-2017-0017

Słowa kluczoweDynamic programming, Routing algorithm, Mesh topology, Time complexity, Space complexity

© 2017 Akash Punhani et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Słowa kluczowe
Dynamic programming, Routing algorithm, Mesh topology, Time complexity, Space complexity