Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1587/transfun.E100.A.2031 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
graphic processing unit, non-deterministic finite automaton, shared memory, string matching | String searching algorithm,Computer science,Theoretical computer science,Finite-state machine | Journal |
Volume | Issue | ISSN |
E100A | 9 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| JinMyung Yoon | 1 | 0 | 0.34 |
| KangIl Choi | 2 | 0 | 0.68 |
| Hyunjin Kim | 3 | 42 | 4.84 |