Keywords
parallel processing
parallel algorithm
boyer-moore
string matching algorithm
performance analysis
parallel algorithm
boyer-moore
string matching algorithm
performance analysis
How to Cite
Abdulellah A.Alsaheel, Abdullah H.Alqahtani. (2013). Analysis of Parallel Boyer-Moore String Search Algorithm. Global Journal of Computer Science and Technology, 13(A1), 43–47. Retrieved from https://gjcst.com/index.php/gjcst/article/view/1542
Abstract
Boyer Moore string matching algorithm is one of the famous algorithms used in string search algorithms Widely it is used in sequential form which presents good performance In this paper a parallel implementation of Boyer Moore algorithm is proposed and evaluated Experimental results show that it is valuable with zero overhead and cost optimal The comparison between sequential and parallel showed that the parallel implementation was faster and more useful
This work is licensed under a Creative Commons Attribution 4.0 International License.
Copyright (c) 2013 Authors and Global Journals Private Limited