Abstract
MapReduce Programming paradigm provides an elegant and efficacious platform for catering large scale parallel implementations of Heuristic Search Algorithms. We present here an implementation and analysis of Parallel Breadth First Heuristic Search (PBFHS) Algorithm for solving very large combinatorial problems. Using N-Puzzle as our application domain we found that the scalability of Breadth First Search (BFS) and Iterative Deepening A* (IDA*) is limited on a single machine due to hardware constraints. In this algorithm, we generate a remarkably restrictive, yet a large search space using combination of highly efficient admissible and non-admissible heuristics. The graphs compiled from resulting output advocates our design and implementation flow. A 7 node Hadoop cluster setup on Amazon EC2, solves the hardest 24 Puzzle in 3 hours, and 35 Puzzle in 13 hours of computing time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
