Parallel processing of hybrid exact string matching algorithm

Abstract

The advancement of computer hardware has opened up new challenges to algorithms experts. One of the challenges is designing new algorithm that exploit the parallel nature of the new architecture of current computer hardware. In this study, we redesign the hybrid exact string matching algorithm named AKRAM on parallel platform with the goal of speeding up the algorithm. The parallel of this algorithm showed optimal results, in parallel time, speed up, efficiency and percentage of performance gain when compared to the sequential version. The result demonstrated that the performance of both parallelized and sequential of AKRAM algorithm was influenced by type of data. The DNA sequence showed the highest performance than other data types after parallelization.