NATR: A new algorithm for tracing routes
| dc.contributor.author | Prasad, G.R. | |
| dc.contributor.author | Shet, K.C. | |
| dc.contributor.author | Bhat Narasimha, B. | |
| dc.date.accessioned | 2026-02-06T06:40:55Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | This paper presents NATR ("New Algorithm for Tracing Routes"), a new shortest path algorithm using reconfigurable logic and has time complexity O(L), where L is shortest path length. It uses ball and string model and is highly parallel and scalable. Unlike most other shortest path algorithms, NATR does not need to find the minimum of nodes/adjacent nodes. Hence its FPGA implementation is faster compared to other FPGA implementations. Preliminary experimental results show that a 17-node NATR runs about 6.3 times faster compared to parallel Bellman-Ford algorithm on Xilinx Virtex II. © Springer Science+Business Media B.V. 2008. | |
| dc.identifier.citation | Innovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering, 2008, Vol., , p. 399-405 | |
| dc.identifier.uri | https://doi.org/10.1007/978-1-4020-8735-6_75 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/33233 | |
| dc.title | NATR: A new algorithm for tracing routes |