Academic Journal
Parallel Optimization of the SSABS Exact String-Matching Algorithm for Shared-Memory Multicore Systems Using POSIX Threads.
| Τίτλος: | Parallel Optimization of the SSABS Exact String-Matching Algorithm for Shared-Memory Multicore Systems Using POSIX Threads. |
|---|---|
| Συγγραφείς: | AbdulRazzaq, Atheer Akram1 (AUTHOR) athproof@uoitc.edu.iq, Mezher, Ahmed Eskander1,2 (AUTHOR), AL-Jumaili, Ahmed Sabah Ahmed1 (AUTHOR), Tayyeh, Huda Kadhim3 (AUTHOR) |
| Πηγή: | Ingénierie des Systèmes d'Information. Jul2026, Vol. 31 Issue 7, p2425-2434. 10p. |
| Θεματικοί όροι: | *Parallel programming, *Scalability, Multicore processors, Benchmark problems (Computer science) |
| Περίληψη: | Exact string matching remains a fundamental operation in many data-intensive applications, where increasing dataset sizes require efficient parallel processing solutions. This study presents a parallel optimization of the Sheik-Sumit-Anindya-Balakrishnan-Sekar (SSABS) exact string-matching algorithm for shared-memory multicore systems using the Portable Operating System Interface (POSIX) threads framework. The proposed implementation divides input text into independent segments with boundary overlap handling to preserve matching accuracy while enabling concurrent execution across multiple CPU cores. The performance of the parallel SSABS algorithm was evaluated using four benchmark datasets, including Extensible Markup Language (XML), Source, Protein, and DNA, with different pattern lengths and core configurations. Experimental results demonstrate that the parallel implementation consistently reduces execution time compared with the sequential version across all tested datasets. The source dataset achieved the shortest parallel execution time due to its larger alphabet size and more effective shift operations; the DNA dataset obtained the highest scalability performance, reaching a maximum speedup of 2.97 and the highest efficiency among the evaluated datasets. Further analysis revealed that increasing the number of cores improves acceleration but introduces synchronization and thread-management overhead, leading to performance saturation at higher core counts. These findings provide insights into the relationship between dataset characteristics, algorithm behavior, and multicore scalability, demonstrating the suitability of Pthreads-based parallelization for accelerating exact string-matching operations. [ABSTRACT FROM AUTHOR] |
| Copyright of Ingénierie des Systèmes d'Information is the property of International Information & Engineering Technology Association (IIETA) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Business Source Index |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: bsx DbLabel: Business Source Index An: 196575158 RelevancyScore: 1435 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1435 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Parallel Optimization of the SSABS Exact String-Matching Algorithm for Shared-Memory Multicore Systems Using POSIX Threads. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22AbdulRazzaq%2C+Atheer+Akram%22">AbdulRazzaq, Atheer Akram</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> athproof@uoitc.edu.iq</i><br /><searchLink fieldCode="AR" term="%22Mezher%2C+Ahmed+Eskander%22">Mezher, Ahmed Eskander</searchLink><relatesTo>1,2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22AL-Jumaili%2C+Ahmed+Sabah+Ahmed%22">AL-Jumaili, Ahmed Sabah Ahmed</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Tayyeh%2C+Huda+Kadhim%22">Tayyeh, Huda Kadhim</searchLink><relatesTo>3</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Ingénierie+des+Systèmes+d'Information%22">Ingénierie des Systèmes d'Information</searchLink>. Jul2026, Vol. 31 Issue 7, p2425-2434. 10p. – Name: Subject Label: Subject Terms Group: Su Data: *<searchLink fieldCode="DE" term="%22Parallel+programming%22">Parallel programming</searchLink><br />*<searchLink fieldCode="DE" term="%22Scalability%22">Scalability</searchLink><br /><searchLink fieldCode="DE" term="%22Multicore+processors%22">Multicore processors</searchLink><br /><searchLink fieldCode="DE" term="%22Benchmark+problems+%28Computer+science%29%22">Benchmark problems (Computer science)</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Exact string matching remains a fundamental operation in many data-intensive applications, where increasing dataset sizes require efficient parallel processing solutions. This study presents a parallel optimization of the Sheik-Sumit-Anindya-Balakrishnan-Sekar (SSABS) exact string-matching algorithm for shared-memory multicore systems using the Portable Operating System Interface (POSIX) threads framework. The proposed implementation divides input text into independent segments with boundary overlap handling to preserve matching accuracy while enabling concurrent execution across multiple CPU cores. The performance of the parallel SSABS algorithm was evaluated using four benchmark datasets, including Extensible Markup Language (XML), Source, Protein, and DNA, with different pattern lengths and core configurations. Experimental results demonstrate that the parallel implementation consistently reduces execution time compared with the sequential version across all tested datasets. The source dataset achieved the shortest parallel execution time due to its larger alphabet size and more effective shift operations; the DNA dataset obtained the highest scalability performance, reaching a maximum speedup of 2.97 and the highest efficiency among the evaluated datasets. Further analysis revealed that increasing the number of cores improves acceleration but introduces synchronization and thread-management overhead, leading to performance saturation at higher core counts. These findings provide insights into the relationship between dataset characteristics, algorithm behavior, and multicore scalability, demonstrating the suitability of Pthreads-based parallelization for accelerating exact string-matching operations. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Ingénierie des Systèmes d'Information is the property of International Information & Engineering Technology Association (IIETA) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=196575158 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.18280/isi.310724 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 10 StartPage: 2425 Subjects: – SubjectFull: Parallel programming Type: general – SubjectFull: Scalability Type: general – SubjectFull: Multicore processors Type: general – SubjectFull: Benchmark problems (Computer science) Type: general Titles: – TitleFull: Parallel Optimization of the SSABS Exact String-Matching Algorithm for Shared-Memory Multicore Systems Using POSIX Threads. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: AbdulRazzaq, Atheer Akram – PersonEntity: Name: NameFull: Mezher, Ahmed Eskander – PersonEntity: Name: NameFull: AL-Jumaili, Ahmed Sabah Ahmed – PersonEntity: Name: NameFull: Tayyeh, Huda Kadhim IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 07 Text: Jul2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 16331311 Numbering: – Type: volume Value: 31 – Type: issue Value: 7 Titles: – TitleFull: Ingénierie des Systèmes d'Information Type: main |
| ResultId | 1 |