A Finite Automaton-Based String Matching Engine on Graphic Processing Unit

JinMyung YOON  Kang-Il CHOI  HyunJin KIM  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E100-A   No.9   pp.2031-2033
Publication Date: 2017/09/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E100.A.2031
Type of Manuscript: LETTER
Category: VLSI Design Technology and CAD
graphic processing unit,  non-deterministic finite automaton,  shared memory,  string matching,  

Full Text: PDF(328.4KB)
>>Buy this Article

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.