Parallel bidirectional A* search on a symmetry multiprocess

Document Type

Conference Proceeding

Publication Date

12-1-1993

Abstract

This report presents our experiences parallelizing and implementing search problems. We take the sequential A* search and parallelize it by combining with bidirectional search, called Parallel Bidirectional A* Search (PBiA*S). To identify the effectiveness of the PBiA*S, we implement two search problems, the Eight Puzzle and the Tower of Hanoi, on a Symmetry multiprocessor. Execution results demonstrate that the PBiA*S can be an effective parallel search method as it gives two to 12-fold speedup over the unidirectional A* search for the two search problems.

Identifier

0027874123 (Scopus)

ISBN

[081864222X]

Publication Title

Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing

First Page

19

Last Page

22

This document is currently not available here.

Share

COinS