Description: The project was aimed to accelerate Boyer-Moore Horsepool Algorithm which is the most used String Matching Algorithm to find a pattern within a given text. We employed various software & hardware techniques to extract parallelism and acceerate the string matching application. All the codes were run in Discovery Cluster. Information about the cluster can be find below.
http://nuweb12.neu.edu/rc/?page_id=27
Authors: Vignesh Kumar Subramanian - OpenMP, MPI+OpenMP, MATLAB PCT Harishankar Patteri
Techniques :
- OpenMP
- MPI
- OpenMP + MPI
- MATLAB PCT (Parallel Computing tool box)
- CUDA (Not completely implemented)
Check the Final Project Report.pdf for complete analysis and performance measurements.