• VIJAY KUMAR
• Alka Singh

String matching is one of the significant classes of problems in computer science. Searching smaller text in larger data in a reasonable time is a difficult task for an algorithm. The Naive string matching algorithm is the basic linear single pattern algorithm. After the survey of the Naive string matching algorithm, we found that the performance of the algorithm is better than some advanced algorithm (Boyer-Moore) when the pattern exists at the starting of the larger data text. In this work, we are applying the Naive string matching algorithm using the proposed concept of parallelization to enhance the performance. The concept of parallelization is based on SIMD architecture where data divided and distributed for parallel processing. Using different JAVA functional parallelism frameworks the results are generated and compared. The comparison suggests that the performance of one framework is proved to be better than another framework.

String Matching, Naïve Algorithm, SIMD, Parallel Naïve

"An Approach to Parallelization of Naive String matching Algorithm using Java Functional Parallelism Frameworks", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.222-226, June 2019, Available :http://www.jetir.org/papers/JETIR1907R36.pdf

"An Approach to Parallelization of Naive String matching Algorithm using Java Functional Parallelism Frameworks", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp222-226, June 2019, Available at : http://www.jetir.org/papers/JETIR1907R36.pdf