DocumentCode :
3325287
Title :
Parallelization of KMP string matching algorithm
Author :
Alzoabi, Ubaid S. ; Alosaimi, Naser M. ; Bedaiwi, Abdullah S. ; Alabdullatif, Abdullatif M.
Author_Institution :
Dept. of Comput. Sci., King Saud Univ., Riyadh, Saudi Arabia
fYear :
2013
fDate :
22-24 June 2013
Firstpage :
1
Lastpage :
3
Abstract :
Knuth Morris-Pratt (KMP) algorithm is one of the most popular strings searching algorithm. The parallelism of KMP is one of research topic over last two years. In our paper we simulated two current parallel algorithms with our new proposed parallel algorithm. Our simulation result presents improvement of our proposed parallel algorithm.
Keywords :
parallel algorithms; search problems; string matching; KMP string matching algorithm; Knuth Morris-Pratt algorithm; parallel algorithm; parallelization; strings searching algorithm; Algorithm design and analysis; Approximation algorithms; Educational institutions; Parallel algorithms; Program processors; Simulation; KMP algorithm; String matching; parallel algorithm; parallelism;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Technology (WCCIT), 2013 World Congress on
Conference_Location :
Sousse
Print_ISBN :
978-1-4799-0460-0
Type :
conf
DOI :
10.1109/WCCIT.2013.6618720
Filename :
6618720
Link To Document :
بازگشت