A Survey of Parallel A*

08/16/2017
by   Alex Fukunaga, et al.
0

A* is a best-first search algorithm for finding optimal-cost paths in graphs. A* benefits significantly from parallelism because in many applications, A* is limited by memory usage, so distributed memory implementations of A* that use all of the aggregate memory on the cluster enable problems that can not be solved by serial, single-machine implementations to be solved. We survey approaches to parallel A*, focusing on decentralized approaches to A* which partition the state space among processors. We also survey approaches to parallel, limited-memory variants of A* such as parallel IDA*.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2018

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

There has been significant interest in parallel graph processing recentl...
research
04/06/2017

A Comparison of Parallel Graph Processing Implementations

The rapidly growing number of large network analysis problems has led to...
research
10/07/2009

Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results)

We explore the use of the Cell Broadband Engine (Cell/BE for short) for ...
research
06/15/2018

Geometric Algorithms with Limited Workspace: A Survey

In the limited workspace model, we consider algorithms whose input resid...
research
04/20/2018

Parallel Quicksort without Pairwise Element Exchange

Standard implementations of 2-way, parallel, distributed memory Quicksor...
research
05/08/2021

Survey of Parallel A* in Rust

A* is one of the most popular Best First Search (BFS) techniques for gra...
research
01/16/2014

Best-First Heuristic Search for Multicore Machines

To harness modern multicore processors, it is imperative to develop para...

Please sign up or login with your details

Forgot password? Click here to reset