Parallel Hybrid String Matching Algorithm Using CUDA API Function

Due to the fast growth of information recently, traditional string matching algorithms face a significant speed challenge. A good string matching algorithm is an algorithm with a small number of character comparisons, a small number of attempts, and a short execution time. These three factors measure the efficiency and performance of string matching algorithms. String matching algorithms are essential in many different applications such as search analysis, intrusion detection, internet search engines, editor’s information retrieval, computer security, and computational biology. These applications use string matching algorithms to search for a small string called a pattern in a large dataset. This search takes a long time and high resources to execute. This paper proposed a parallel design of a hybrid string matching called SSTBMQS on a GPU device using CUDA API. The result shows that the parallel version of SSTBMQS algorithm on GPU device using CUDA API function is unappropriated and un-recommended.