Skip to main content
Springer Nature Link
Log in

High performance parallel KMP algorithm on a heterogeneous architecture

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

String matching algorithm is widely used in many application areas such as bio-informatics, network intrusion detection, computer virus scan, among many others. Knuth–Morris–Pratt (KMP) algorithm is commonly used for its fast execution time compared with many other string matching algorithms when applied to large input texts. However, the performance of the KMP algorithm is limited when the input text size increases significantly beyond a certain limit. In this paper, we propose a high performance parallel KMP algorithm on the Heterogeneous High Performance Computing (HPC) architecture based on the general-purpose multicore microprocessor and the manycore graphic processing unit (GPU) using OpenCL as the General Purpose computing using Graphic Processing Unit (GPGPU) platform. The proposed parallel KMP algorithm mainly focuses on optimizing the CPU–GPU memory hierarchy by overlapping the data transfer between the CPU memory and the GPU memory with the string matching operations on the GPU. It also optimizes the allocation of the work-groups and the work-items, and places the pattern data and the failure table in the on-chip local memory of the GPU. Exploiting multiple GPUs further the performance improvements. The experimental results show that the optimized parallel KMP algorithm leads up to 15.25 times speedup compared with the version before our optimization techniques were applied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Bellekens, X., Atkinson, R.C., Renfrew, C., Kirkham, T.: Investigation of GPU-based pattern matching. In: Proceeedings of the 14th Annual Post Graduate Symposium on the Convergence of Telecommunications, Networking and Broadcasting (PGNet2013) (2013)

  2. Jiang, W., Yang, Y.H.E., Prasanna, V.K.: Scalable multi-pipeline architecture for high performance multi-pattern string matching. In: Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2010) (2010)

  3. Rajesh, S., Prathima, S., Reddy, D.L.S.S.: Unusual pattern detection in DNA database using KMP algorithm. Int. J. Comput. Appl. 1(22), 1–7 (2010)

    Google Scholar 

  4. Kalubandi, V.K.P., Varalakshmi, M.: Accelerated spam filtering with enhanced KMP algorithm on GPU. In: 2017 National Conference on Parallel Computing Technologies (PARCOMPTECH) (2017)

  5. Al-Ssulami, A.M.: Hybrid string matching algorithm with a pivot. J. Inf. Sci. 41(1), 82–88 (2014)

    Article  Google Scholar 

  6. Kim, J.W., Kim, E., Park, K.: Fast Matching method for DNA sequences. In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (2007)

  7. Sitaridi, E.A., Ross, K.A.: GPU-accelerated string matching for database applications. In: VLDB J (2016)

  8. NVIDIA: Cuda C Programming Guide. https://developer.download.nvidia.com/compute/DevZone/docs/html/C/doc/CUDA_C_Programming_Guide.pdf (2012)

  9. Manavski, S.A.: Cuda compatible GPU as an efficient hardware. No. November, pp. 24–27 (2007)

  10. AMD: AMD accelerated parallel processing OpenCL programming guide. AMD Document. http://amd-dev.wpengine.netdna-cdn.com/wordpress/media/2013/07/AMD_Accelerated_Parallel_Processing_OpenCL_Programming_Guide-rev-2.7.pdf (2013)

  11. Nvidia: OpenCL Programming Guide for the CUDA Architecture. Nvidia. https://www.nvidia.com/content/cudazone/download/opencl/nvidia_opencl_programmingguide.pdf (2009)

  12. OpenACCstandard.org: The OpenACC Application Programming Interface 2.5. Openacc.Org Doc., pp. 1–118 (2015)

  13. Sidhu, R.P.S., Mei, A., Prasanna, V.K.: String matching on multicontext FPGAs using self-reconfiguration. In: Proceedings of 1999 ACM/SIGDA Seventh International Symposium on Field Programmable Gate Arrays, pp. 217–226 (1999)

  14. Rasool, A., Khare, N.: Parallelization of KMP string matching algorithm on different SIMD architectures: multi-core and GPGPU’s. Int. J. Comput. Appl. 49(11), 26–28 (2012)

    Google Scholar 

  15. Aygun, S., Gunes, E.O., Kouhalvandi, L.: Python based parallel application of Knuth-Morris-Pratt algorithm. In: Proceedings of 2016 IEEE 4th Workshop on Advances in Information, Electronic and Electrical Engineering (AIEEE 2016) (2017)

  16. Alzoabi, U.S., Alosaimi, N.M., Bedaiwi, A.S., Alabdullatif, A.M.: Parallelization of KMP string matching algorithm. In: Proceeedings of 2013 World Congress on Computer and Information Technology (WCCIT 2013) (2013)

  17. Lei, S., Wang, C., Fang, H., Li, X., Zhou, X.: SCADIS: a scalable accelerator for data-intensive string set matching on FPGAs. In: Proceeedings of 2016 IEEE Trustcom/BigDataSE/ISPA, pp. 1190–1197 (2016)

  18. Kouzinopoulos, C.S., Margaritis, K.G.: String matching on a multicore GPU using CUDA. In: Proceeedings of 2009 13th Panhellenic Conference on Informatics (PCI 2009), pp. 14–18 (2009)

  19. Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research was supported in part by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. 2017R1D1A1B03033128). This research was supported in part by Next-Generation Information Computing Development Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science, and Technology (NRF-2015M3C4A7065662).

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Konkuk University, Seoul, Korea

    Neungsoo Park & Soeun Park

  2. Department of Computer Science & Engineering, Myongji University, Yongin, Kyungkido, Korea

    Myungho Lee

Authors
  1. Neungsoo Park
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Soeun Park
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Myungho Lee
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Myungho Lee.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Park, N., Park, S. & Lee, M. High performance parallel KMP algorithm on a heterogeneous architecture. Cluster Comput 23, 2205–2217 (2020). https://doi.org/10.1007/s10586-019-02975-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-019-02975-5

Keywords