Please use this identifier to cite or link to this item:
|Title:||Accelerating Pattern Matching Using a Novel Parallel Algorithm on GPUs|
|Abstract:||Graphics processing units (GPUs) have attracted a lot of attention due to their cost-effective and enormous power for massive data parallel computing. In this paper, we propose a novel parallel algorithm for exact pattern matching on GPUs. A traditional exact pattern matching algorithm matches multiple patterns simultaneously by traversing a special state machine called an Aho-Corasick machine. Considering the particular parallel architecture of GPUs, in this paper, we first propose an efficient state machine on which we perform very efficient parallel algorithms. Also several techniques are introduced to do optimization on GPUs, including reducing global memory transactions of input buffer, reducing latency of transition table lookup, eliminating output table accesses, avoiding bank-conflict of shared memory, coalescing writes to global memory, and enhancing data transmission via Peripheral Component Interconnect Express (PCIe). We evaluate the performance of the proposed algorithm using attack patterns from Snort V2.8 and input streams from DEFCON. The experimental results show that the proposed algorithm performed on NVIDIA GPUs achieves up to 143.16 Gbps throughput, 14.74 times faster than the Aho-Corasick algorithm implemented on a 3.06 GHz quad-core CPU with the OpenMP. The library of the proposed algorithm is publically accessible through Google Code.|
|Appears in Collections:||教師著作|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.