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

JinMyung YOON; Kang-Il CHOI; HyunJin KIM

doi:10.1587/transfun.E100.A.2031

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Regular Section

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

JinMyung YOON, Kang-Il CHOI, HyunJin KIM

Author information

Keywords: graphic processing unit, non-deterministic finite automaton, shared memory, string matching

JOURNAL RESTRICTED ACCESS

2017 Volume E100.A Issue 9 Pages 2031-2033

DOI https://doi.org/10.1587/transfun.E100.A.2031

Details

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.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!