Field programmable gate array-based acceleration of shortest-path computation
There exist several practical applications that require high-speed shortest-path computations. In many situations, especially in embedded applications, an field programmable gate array (FPGA)-based accelerator for computing the shortest paths can help to achieve high performance at low cost. This st...
Saved in:
Main Authors: | Jagadeesh, George Rosario, Srikanthan, T.., Lim, C. M. |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Article |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/104263 http://hdl.handle.net/10220/20133 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Fast computation of clustered many-to-many shortest paths and its application to map matching
by: Jagadeesh, George Rosario, et al.
Published: (2020) -
Hardware-accelerated shortest path computation
by: Yeo, Wei Jie
Published: (2016) -
Shortest path computation for roadway network
by: Khoo, Gilbert Teng Sheng
Published: (2016) -
Accelerating exact constrained shortest paths on GPUs
by: LU, Shengliang, et al.
Published: (2020) -
Constrained Shortest Path Computation
by: TERROVITIS, Manolis, et al.
Published: (2005)