Parallel processing of hybrid exact string matching algorithm

Abdulrazzaq, Atheer Akram; Rashid, Nur’Aini Abdul; Alezzi, Ayad Hussain Abdulkader

doi:10.1109/iccsce.2013.6719959

Cited by 2 publications

(4 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is due to the increase in the communication time. When the number of cores in parallel and pattern length increase, the parallel and sequential times are decrease in the long and short pattern lengths [13], [23].…”

Section: Discussion and Analysismentioning

confidence: 99%

“…The AKRAM algorithm that was adopted in the parallelization process utilized the technique of data decomposition, which segregated the data into numerous subparts and were distributed to the processors inside the cluster. The MPI multiprocessor model indicated a high performance computing ability in contrast to the performance of sequential computing in the AKRAM algorithm [13]. Additionally, there are exact string matching algorithms that used multiprocessor parallel technology, and among them is the Karp-Rabin algorithm, which divides the string into subsets and each individual ones are compared with the pattern separately.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Parallel processing of E-Atheer algorithm using pthread paradigm

Abdulrazzaq

Fadhel

Alzubaidi

et al. 2023

IJEECS

View full text Add to dashboard Cite

The development in the field of computer technology, and the increase in the growth rate of database, alongside the extraction of certain data from a huge pool of database involve intricate and complex processes. The processes comprise text mining, pattern recognition, retrieval of information and text processing. Thus, the need for enhancing the performance of string matching algorithms is required, which is considered as one of the challenges to the researchers. Consequently, one of the resolution to address this problem is the parallelization for exact string matching algorithms. In this study, we implemented the parallel exact string matching algorithm termed as E-Atheer with multi-core processing utilizing Pthread (POSIX) for the reduction of time consumption. The Pitch, XML, Protein, and DNA database types are utilized to test the impact of the proposed parallel algorithm. The parallelization algorithm obtained positive results in the parallel execution time, and a more superior expediting capabilities, in comparison to the sequential result. The Pitch database indicated optimal results in parallel execution time, and when utilizing long and short pattern lengths. The DNA database indicated optimal speedup performance when utilizing short and long pattern length, meanwhile the XML and Protein on the other hand indicated the worst results.

show abstract

Section: Discussion and Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Parallel processing of E-Atheer algorithm using pthread paradigm

Abdulrazzaq

Fadhel

Alzubaidi

et al. 2023

IJEECS

View full text Add to dashboard Cite

show abstract

“…The proposed approach uses multicore processors for parallel processing. The obtained DNA sequence shows the highest performance among those of other serial versions of algorithms after parallelization [113].…”

Section: ) Implementation Of String Matching Algorithms In Mapreducementioning

confidence: 97%

“…The trend has already started. Abdulrazzaq et al [113] developed a new algorithm for DNS sequence matching by using an MPI technique. The proposed approach uses multicore processors for parallel processing.…”

Section: ) Implementation Of String Matching Algorithms In Mapreducementioning

confidence: 99%

Exact String Matching Algorithms: Survey, Issues, and Future Research Directions

et al. 2019

View full text Add to dashboard Cite

String matching has been an extensively studied research domain in the past two decades due to its various applications in the fields of text, image, signal, and speech processing. As a result, choosing an appropriate string matching algorithm for current applications and addressing challenges is difficult. Understanding different string matching approaches (such as exact string matching and approximate string matching algorithms), integrating several algorithms, and modifying algorithms to address related issues are also difficult. This paper presents a survey on single-pattern exact string matching algorithms. The main purpose of this survey is to propose new classification, identify new directions and highlight the possible challenges, current trends, and future works in the area of string matching algorithms with a core focus on exact string matching algorithms.

show abstract

Parallel processing of hybrid exact string matching algorithm

Cited by 2 publications

References 3 publications

Parallel processing of E-Atheer algorithm using pthread paradigm

Parallel processing of E-Atheer algorithm using pthread paradigm

Exact String Matching Algorithms: Survey, Issues, and Future Research Directions

Contact Info

Product

Resources

About