Parallel bidirectional A* search on a symmetry multiprocessor

Author

Sohn, Andrew

Author_Institution

Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA

fYear

1993

fDate

1-4 Dec 1993

Firstpage

19

Lastpage

22

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 two 12-fold speedup over the unidirectional A* search for the two search problems

Keywords

multiprocessing programs; parallel algorithms; search problems; Eight Puzzle; PBiA*S; Tower of Hanoi; execution results; parallel bidirectional A* search; search problems; sequential A* search; symmetry multiprocessor; two two 12-fold speedup; unidirectional A* search; Heuristic algorithms; Information science; Parallel processing; Poles and towers; Problem-solving; Search methods; Search problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Conference_Location

Dallas, TX

Print_ISBN

0-8186-4222-X

Type

conf

DOI

10.1109/SPDP.1993.395556

Filename

395556