Abstract
Regular expression matching is a central task in several networking (and search) applications and has been accelerated on a variety of parallel architectures. All solutions are based on finite automata (either in deterministic or non-deterministic form), and mostly focus on effective memory representations for such automata. Recently, a handful of work has proposed efficient regular expression matching designs for GPUs; however, most of them aim at achieving good performance on small datasets. Nowadays, practical solutions must support the increased size and complexity of real world datasets. In this work, we explore the deployment and optimization of different GPU designs of regular expression matching engines, focusing on large datasets containing a large number of complex patterns.
- N. Cascarano et al. iNFAnt: NFA Pattern Matching on GPGPU Devices. In ACM SIGCOMM Computer Communication Review, vol. 40 Num. 5, pp. 21--26, 2010. Google Scholar
Digital Library
- M. Becchi et al. An Improved Algorithm to Accelerate Regular Expression Evaluation. In Proc. of ANCS 2007, pp. 145--154, 2007. Google Scholar
Digital Library
- F. Yu et al. Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection. In Proc. of ANCS 2006, pp. 93--102, 2006. Google Scholar
Digital Library
- M. Becchi et al. A Workload for Evaluating Deep Packet Inspection Architectures. In Proc. of IISWC 2008, pp. 79--89, 2008.Google Scholar
Cross Ref
Index Terms
Exploring different automata representations for efficient regular expression matching on GPUs
Recommendations
GPU acceleration of regular expression matching for large datasets: exploring the implementation space
CF '13: Proceedings of the ACM International Conference on Computing FrontiersRegular expression matching is a central task in several networking (and search) applications and has been accelerated on a variety of parallel architectures, including general purpose multi-core processors, network processors, field programmable gate ...
Exploring different automata representations for efficient regular expression matching on GPUs
PPoPP '13: Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programmingRegular expression matching is a central task in several networking (and search) applications and has been accelerated on a variety of parallel architectures. All solutions are based on finite automata (either in deterministic or non-deterministic form),...
GPU-based NFA implementation for memory efficient high speed regular expression matching
PPoPP '12: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel ProgrammingRegular expression pattern matching is the foundation and core engine of many network functions, such as network intrusion detection, worm detection, traffic analysis, web applications and so on. DFA-based solutions suffer exponentially exploding state ...







Comments