TY - GEN
T1 - Parallel bidirectional A* search on a symmetry multiprocess
AU - Sohn, Andrew
PY - 1993
Y1 - 1993
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0027874123&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027874123&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0027874123
SN - 081864222X
T3 - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
SP - 19
EP - 22
BT - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
A2 - Anon, null
PB - Publ by IEEE
T2 - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
Y2 - 1 December 1993 through 4 December 1993
ER -