8852

Exploring Different Automata Representations for Efficient Regular Expression Matching on GPUs

Xiaodong Yu, Michela Becchi
Dept. of Electrical and Computer Engineering, University of Missouri, Columbia, MO
18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 2013), 2013

@article{yu2013exploring,

   title={Exploring Different Automata Representations for Efficient Regular Expression Matching on GPUs},

   author={Yu, X. and Becchi, M.},

   year={2013}

}

Download Download (PDF)   View View   Source Source   

2028

views

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.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2024 hgpu.org

All rights belong to the respective authors

Contact us: