Level Based Routing Using Dynamic Programming for 2D Mesh

Cybernetics and Information Technologies

Nitin Nitin¹  Punhani Akash²  Kumar Pardeep² 

[1] Jaypee Institute of Information Technology, Noida, Uttar Pradesh, India;Jaypee University of Information Technology, Solan, Himachal Pradesh 173234, India;

关键词: dynamic programming;    routing algorithm;    mesh topology;    time complexity;    space complexity;   

DOI  :  10.1515/cait-2017-0017

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown