A Highly-Efficient Memory-Compression Scheme for GPU-Accelerated Intrusion Detection Systems
Open Access
- 9 September 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 302-309
Abstract
Pattern Matching is a computationally intensive task used in many research fields and real world applications. Due to the ever-growing volume of data to be processed, and increasing link speeds, the number of patterns to be matched has risen significantly. In this paper we explore the parallel capabilities of modern General Purpose Graphics Processing Units (GPGPU) applications for high speed pattern matching. A highly compressed failure-less Aho-Corasick algorithm is presented for Intrusion Detection Systems on off-the-shelf hardware. This approach maximises the bandwidth for data transfers between the host and the Graphics Processing Unit (GPU). Experiments are performed on multiple alphabet sizes, demonstrating the capabilities of the library to be used in different research fields, while sustaining an adequate throughput for intrusion detection systems or DNA sequencing. The work also explores the performance impact of adequate prefix matching for alphabet sizes and varying pattern numbers achieving speeds up to 8Gbps and low memory consumption for intrusion detection systems.Comment: Published in The 7th International Conference of Security of Information and Networks, SIN 2014, Glasgow, UK, September, 201Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Parallel Text Matching Using GPGPU2012
- A Highly-Efficient Memory-Compression Approach for GPU-Accelerated Virus Signature Matching2012
- Accelerating String Matching Using Multi-Threaded Algorithm on GPU2010
- GrAVity: A Massively Parallel Antivirus Engine2010
- Fast Virus Signature Matching Based on the High Performance Computing of GPU2010
- Offloading IDS Computation to the GPU2006
- Fast, Large-Scale String Match for a 10Gbps FPGA-Based Network Intrusion Detection System2003
- Mersenne twisterACM Transactions on Modeling and Computer Simulation, 1998
- Efficient string matchingCommunications of the ACM, 1975