Parallel bidirectional A* search on a symmetry multiprocess

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
Editors Anon
PublisherPubl by IEEE
Pages19-22
Number of pages4
ISBN (Print)081864222X
StatePublished - Dec 1 1993
EventProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA
Duration: Dec 1 1993Dec 4 1993

Other

OtherProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
CityDallas, TX, USA
Period12/1/9312/4/93

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Parallel bidirectional A* search on a symmetry multiprocess'. Together they form a unique fingerprint.

Cite this