Efficient pattern matching on GPUs for intrusion detection systems

Authors:
Antonino Tumeo;Oreste Villa;Donatella Sciuto
Affiliations:
Pacific Northwest National Laboratory, Richland, WA, USA;Pacific Northwest National Laboratory, Richland, WA, USA;Politecnico di Milano, Milano, Italy
Venue:
Proceedings of the 7th ACM international conference on Computing frontiers
Year:
2010

Citing 2
Cited 3

Efficient string matching: an aid to bibliographic search

Communications of the ACM
Snort - Lightweight Intrusion Detection for Networks

LISA '99 Proceedings of the 13th USENIX conference on System administration

GrAVity: a massively parallel antivirus engine

RAID'10 Proceedings of the 13th international conference on Recent advances in intrusion detection
CUDACS: securing the cloud with CUDA-enabled secure virtualization

ICICS'10 Proceedings of the 12th international conference on Information and communications security
An efficient multicharacter transition string-matching engine based on the aho-corasick algorithm

ACM Transactions on Architecture and Code Optimization (TACO)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an efficient implementation of the Aho-Corasick pattern matching algorithm on Graphics Processing Units (GPU), showing how we redesigned the algorithm and the data structures to fit on the architecture and comparing it with an equivalent implementation on the CPU. We show that with a synthetic dataset, our implementation obtains a speedup up to 6.67 with respect to the CPU solution.