Full Text:
<217>
CLC number:
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 0000-00-00
Cited: 0
Clicked: 367
CUSMART:effective parallelization of string-matching algorithms using GPGPU accelerators
| |||||||||||||
Adnan OZSOY, Mengu NAZLI, Onur CANKUR, Cagri SAHIN. CUSMART:effective parallelization of string-matching algorithms using GPGPU accelerators[J]. Frontiers of Information Technology & Electronic Engineering, 1998, -1(-1): .
@article{title="CUSMART:effective parallelization of string-matching algorithms using GPGPU accelerators",
author="Adnan OZSOY, Mengu NAZLI, Onur CANKUR, Cagri SAHIN",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="-1",
number="-1",
pages="",
year="1998",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.2400091"
}
%0 Journal Article
%T CUSMART:effective parallelization of string-matching algorithms using GPGPU accelerators
%A Adnan OZSOY
%A Mengu NAZLI
%A Onur CANKUR
%A Cagri SAHIN
%J Journal of Zhejiang University SCIENCE C
%V -1
%N -1
%P
%@ 2095-9184
%D 1998
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.2400091
TY - JOUR
T1 - CUSMART:effective parallelization of string-matching algorithms using GPGPU accelerators
A1 - Adnan OZSOY
A1 - Mengu NAZLI
A1 - Onur CANKUR
A1 - Cagri SAHIN
J0 - Journal of Zhejiang University Science C
VL - -1
IS - -1
SP -
EP -
%@ 2095-9184
Y1 - 1998
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.2400091
Abstract: This study presents a parallel version of the string matching Algorithms Research Tool (SMART) library, implemented on nvidia’s Compute Unified Device Architecture (CUDA) platform, and utilizes general purpose graphics processing unit (GPGPU) programming concepts to enhance performance and gain insight on the parallel versions of these algorithms. We have developed the CUDA-enhanced SMART (CUSMART) library, which incorporates parallelized iterations of 64 string matching algorithms, leveraging the CUDA application programming interface (API). The performance of these algorithms has been assessed across various scenarios to ensure a comprehensive and impartial comparison, allowing for the identification of their strengths and weaknesses in specific application contexts. We have explored and established optimization techniques to gauge their influence on the performance of these algorithms. The results of this study show that the potential highlight of GPGPU computing in string matching applications is highlighted by the scalability of algorithms, suggesting significant performance improvements. Furthermore, we have identified the best and worst performing algorithms in various scenarios.
Open peer comments: Debate/Discuss/Question/Opinion
<1>