IEICE TRANSACTIONS on Fundamentals
A Finite Automaton-Based String Matching Engine on Graphic Processing Unit
Summary :
A non-deterministic finite automaton (NFA)-based parallel string matching scheme is proposed. To parallelize the operations of NFAs, a graphic processing unit (GPU) is adopted. Considering the resource occupancy of threads and size of the shared memory, the optimized resource allocation is performed in the proposed string matching scheme. Therefore, the performance is enhanced significantly in all evaluations.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.9 pp.2031-2033
- Publication Date
- 2017/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.2031
- Type of Manuscript
- LETTER
- Category
- VLSI Design Technology and CAD
Authors
JinMyung YOON
Dankook University
Kang-Il CHOI
Electronics and Telecommunications Research Institute
HyunJin KIM
Dankook University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
JinMyung YOON, Kang-Il CHOI, HyunJin KIM, "A Finite Automaton-Based String Matching Engine on Graphic Processing Unit" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 9, pp. 2031-2033, September 2017, doi: 10.1587/transfun.E100.A.2031.
Abstract: A non-deterministic finite automaton (NFA)-based parallel string matching scheme is proposed. To parallelize the operations of NFAs, a graphic processing unit (GPU) is adopted. Considering the resource occupancy of threads and size of the shared memory, the optimized resource allocation is performed in the proposed string matching scheme. Therefore, the performance is enhanced significantly in all evaluations.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.2031/_p
Copy
@ARTICLE{e100-a_9_2031,
author={JinMyung YOON, Kang-Il CHOI, HyunJin KIM, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Finite Automaton-Based String Matching Engine on Graphic Processing Unit},
year={2017},
volume={E100-A},
number={9},
pages={2031-2033},
abstract={A non-deterministic finite automaton (NFA)-based parallel string matching scheme is proposed. To parallelize the operations of NFAs, a graphic processing unit (GPU) is adopted. Considering the resource occupancy of threads and size of the shared memory, the optimized resource allocation is performed in the proposed string matching scheme. Therefore, the performance is enhanced significantly in all evaluations.},
keywords={},
doi={10.1587/transfun.E100.A.2031},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - A Finite Automaton-Based String Matching Engine on Graphic Processing Unit
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2031
EP - 2033
AU - JinMyung YOON
AU - Kang-Il CHOI
AU - HyunJin KIM
PY - 2017
DO - 10.1587/transfun.E100.A.2031
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2017
AB - A non-deterministic finite automaton (NFA)-based parallel string matching scheme is proposed. To parallelize the operations of NFAs, a graphic processing unit (GPU) is adopted. Considering the resource occupancy of threads and size of the shared memory, the optimized resource allocation is performed in the proposed string matching scheme. Therefore, the performance is enhanced significantly in all evaluations.
ER -
English
