2017 International Symposium on Computer Architecture and High Performance Computing Workshops (SBAC-PADW) 2017
DOI: 10.1109/sbac-padw.2017.25
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Pathfinding Co-Processors for FPGAs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Idris [27] proposed the hardware architecture of accelerator for A * algorithm but did not provide simulation result. Nery et al [28] provided the coprocessor design based on Xilinx High-Level Synthesis (HLS) compiler and achieved 2.16x speedup for A * algorithm. However, they did not tackle the bottleneck problem of sorting OPEN list.…”
Section: Fpga Implementation Of Path-planning Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…Idris [27] proposed the hardware architecture of accelerator for A * algorithm but did not provide simulation result. Nery et al [28] provided the coprocessor design based on Xilinx High-Level Synthesis (HLS) compiler and achieved 2.16x speedup for A * algorithm. However, they did not tackle the bottleneck problem of sorting OPEN list.…”
Section: Fpga Implementation Of Path-planning Algorithmsmentioning
confidence: 99%
“…Yap et al [20] proposed block A * algorithm and achieved up to 4.7x speedup. Nery et al [28] provided the hardware implementation based on Xilinx High-Level Synthesis (HLS) compiler and achieved 2.16x speedup. e comparison results are summarized in Table 6.…”
Section: Comparisonmentioning
confidence: 99%
See 1 more Smart Citation