Enhancement of Hakak’s Split-Based Searching Algorithm through Multiprocessing


Authors : Enrico Sebastian Digman; Robbie Shane Orantoy; John Alfred Velasco; Mark Christopher Blanco; Richard Regala; Dan Michael Cortez

Volume/Issue : Volume 7 - 2022, Issue 4 - April

Google Scholar : https://bit.ly/3IIfn9N

Scribd : https://bit.ly/3Ni1nGk

DOI : https://doi.org/10.5281/zenodo.6558758

One of the recent string-matching algorithms classified as a Hybrid Boyer Moore Approach is Hakak’s Split-Based Searching Algorithm which works by dividing the pattern into two parts while concentrating most of the searching process only to the second half of the pattern. However, the algorithm calls for optimization to its searching phase since it still employs the single shifting for instances where a mismatch is met. This paper presents an enhanced version of the algorithm by applying multiprocessing emphasizing its ability to make use of multiple CPU (Central Processing Unit) cores in finding occurrences of the pattern during the searching phase. Through this, concurrency and parallelism can be reached in the existing algorithm that is only limited to using a single processor prior enhancement. In conclusion, this study successfully enhanced the existing algorithm in terms of time complexity by maximizing the usage of memory resources.

Keywords : Hakak’s Split-Based Searching Algorithm, String Matching, Multiprocessing.

CALL FOR PAPERS


Paper Submission Last Date
31 - July - 2022

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe