International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 179 - Number 18 |
Year of Publication: 2018 |
Authors: Wafa Dababat, Mariam Itriq |
10.5120/ijca2018916317 |
Wafa Dababat, Mariam Itriq . Parallel Enhanced Pattern Matching Algorithm with Two Sliding Windows PETSW. International Journal of Computer Applications. 179, 18 ( Feb 2018), 40-46. DOI=10.5120/ijca2018916317
String matching problem is one of the most essential problems in many computer science fields, such as DNA analysis, artificial intelligence, internet search engines and information retrieval. Today, the speed and performance of string matching algorithms is critical and must be improved to meet recent developments in hardware processing environments. The improvement in performance gained by the use of a multi core processor depends very much on the software algorithms used and their implementation. However, the most important factor when writing a parallel algorithm is the fraction of the algorithm that can run simultaneously on multiple cores. In this paper, an efficient algorithm for string matching, Enhanced Pattern Matching Algorithm with Two Sliding Windows (ETWS), is adapted to be implemented under a real parallel environment (PETWS), to enhance the performance of the sequential algorithm through providing less execution time to make it more suitable for today's applications.