String (physics)

Algorithm

Mathematical physics

Statistics

Interleaving

CUDA

Theoretical computer science

Approximate string matching

Operating system

Data mining

Parallel computing

Computer science

Speedup

Regular expression

Mathematics

Computer engineering

Commentz-Walter algorithm

Intrusion detection system

Matching (statistics)

Programming language

Pattern matching

String searching algorithm

International Journal of Communication Networks and Information Security (IJCNIS)

String matching algorithms are computationally intensive operations in computer science. The algorithms null null fi null nd the occurrences of one or more strings patterns in a larger string or text. String matching algorithms are important for network security, biomedical applications, Web search, and social networks. Nowadays, the high network speeds and large storage capacity put a high requirement on string matching methods to perform the task in a short time. Traditionally, Aho-Corasick algorithm, which is used to null null fi null nd the string matches, is executed sequentially. In this paper, a new multi-threaded and interleaving approach of Aho-Corasick using graphics processing units (GPUs) is designed and implemented to achieve null null high-speed string matching. Compute Unified null null Device Architecture (CUDA) programming language is used to implement the proposed parallel version. Experimental results show that our approach achieves more than 5X speedup over the sequential and other para null llel implementations. Hence, a wide range of null null applications can benefit from our solution to perform string matching faster than ever before.

A New Multi-threaded and Interleaving Approach to Enhance String Matching for Intrusion Detection Systems