Abstract
SummaryFinding link/node‐disjoint paths between a pair of nodes is capable of providing Quality of Service and reliable routing which is very critical for mesh‐connected Network‐on‐Chip. State‐of‐art works usually aim at random topologies and multiple constraints. Therefore, it is difficult to optimize their time complexity. In this paper, MDPPIM (Manhattan‐distance‐constrained Disjoint Path Pair Problem in Incomplete Mesh) problem is presented based on Network‐on‐Chip application scenarios. Then, PCDP (Path‐Counting Disjoint Path) algorithm is proposed to solve the MDPPIM problem with low time complexity. Compared with previous disjoint path algorithms, PCDP algorithm does not have to use Dijkstra's algorithm to find a shortest path. It is optimized according to the feature of incomplete mesh such as the regularity of mesh and Manhattan‐distance constraint. Therefore, it is with low time complexity. Numerical results demonstrate the proposed PCDP algorithm's effectiveness and low time complexity.
Sign-in/Register to access full text options 
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 callMore From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
