TITLE:
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
AUTHORS:
Sinan Sameer Mahmood Al-Dabbagh, Nawaf Hazim Barnouti, Mustafa Abdul Sahib Naser, Zaid G. Ali
KEYWORDS:
String Matching, Pattern Matching, String Searching, Algorithms, Quick Search Algorithm, Exact String Matching Algorithm, ? Parallelization, OpenMP
JOURNAL NAME:
Journal of Computer and Communications,
Vol.4 No.13,
October
18,
2016
ABSTRACT: String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the
string matching service for their end users. The remarkable boost in the
number of data that is created and kept by modern computational devices
influences researchers to obtain even more powerful methods for coping with
this problem. In this research, the Quick Search string matching algorithm are
adopted to be implemented under the multi-core environment using OpenMP directive
which can be employed to reduce the overall execution time of the program.
English text, Proteins and DNA data types are utilized to examine the effect
of parallelization and implementation of Quick Search string matching
algorithm on multi-core based environment. Experimental outcomes reveal that
the overall performance of the mentioned string matching algorithm has been
improved, and the improvement in the execution time which has been obtained is
considerable enough to recommend the multi-core environment as the suitable
platform for parallelizing the Quick Search string matching algorithm.