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 language | English (US) |
|---|---|
| Title of host publication | Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing |
| Editors | Anon |
| Publisher | Publ by IEEE |
| Pages | 19-22 |
| Number of pages | 4 |
| ISBN (Print) | 081864222X |
| State | Published - Dec 1 1993 |
| Event | Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA Duration: Dec 1 1993 → Dec 4 1993 |
Other
| Other | Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing |
|---|---|
| City | Dallas, TX, USA |
| Period | 12/1/93 → 12/4/93 |
All Science Journal Classification (ASJC) codes
- Engineering(all)