arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.03573cs.DC
收藏

Rust中的平行A*

Survey of Parallel A* in Rust

Brett Fazio, Ellie Kozlowski, Dylan Ochoa, Blake Robertson, Idel Martinez

摘要:

A* 是最流行的最佳优先搜索(BFS)技术之一。它将基于成本的广度优先搜索与每个节点的计算启发式搜索相结合,以尝试比传统的广度优先搜索或深度优先搜索技术更快地定位目标路径。然而,A* 是一种顺序算法。标准实现只在一个线程中运行。有一些尝试让A* 利用多线程。集中式(SPA*)和分散式(DPA*,HDA*)方法是最标准的尝试,其中最独特和最现代的方法是并行A*(MPA* 或GA*)。我们将尝试在Rust中实现每一个,以确定是否有性能提升,以及哪一个具有最佳性能。

英文摘要:

A* is one of the most popular Best First Search (BFS) techniques for graphs. It combines the cost-based search of Breadth First Search with a computed heuristic for each node to attempt to locate the goal path faster than traditional Breadth First Search or Depth First Search techniques. However, A* is a sequential algorithm. The standard implementation only runs in one thread. There are a few attempts to get A* to leverage multiple threads. Centralized (SPA*) and Decentralized (DPA*, HDA*) methods are the most standard attempts, with the most unique and modern method being massively-parallel A* (MPA* or GA*). We will attempt an implementation of each in Rust to determine if there is a performance boost, and which one has the best performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑