Name
Abstract | ||
|---|---|---|
A* search is a best-first search algorithm that is widely used in pathfinding and graph traversal. To meet the ever-increasing demand of performance, various high-performance architectures (e.g., multi-core CPU and GPU) have been explored to accelerate the A* search. However, the current GPU based A* search approaches are merely designed based on single-GPU architecture. Nowadays, the amount of data grows at an exponential rate, making it inefficient or even infeasible for the current A* to process the data sets entirely on a single GPU. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.future.2021.04.011 | Future Generation Computer Systems |
Keywords | DocType | Volume |
A* search,GPU,Multi-GPU,Graph partition,Parallelism | Journal | 123 |
ISSN | Citations | PageRank |
0167-739X | 2 | 0.40 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xin He | 1 | 80 | 28.00 |
| Yapeng Yao | 2 | 2 | 0.40 |
| zhiwen chen | 3 | 10 | 2.61 |
| Jianhua Sun | 4 | 192 | 25.27 |
| Hao Chen | 5 | 211 | 37.88 |