Please use this identifier to cite or link to this item:
Title: NATR: A new algorithm for tracing routes
Authors: Prasad, G.R.
Shet, K., C.
Bhat, Narasimha, B.
Issue Date: 2008
Citation: Innovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering, 2008, Vol., , pp.399-405
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.
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
8548.pdf299.24 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.