Abstract
Regular Expression (RE) is widely used in many aspects due to its high expressiveness, flexibility and compactness, which requires a high-performance and efficient matching method. A novel approach to accelerate RE pattern matching based on Pattern-Unit (PUREM) is proposed here, in which Pattern-Unit matching is accomplished by a Reconfigurable Function Unit (RFU). The RFU can be integrated into the pipeline of CPU architecture and shares matching jobs with software, without wrecking the compatibility of applications. Compared with other works, our approach offers a flexible mechanism under which hardware does NOT need to vary with RE patterns, and it holds the scalability that can be easily extended to most RE applications and software. For validation, the PUREM HW/SW system has been implemented on the Snort v2.8 and PCRE v7.6 applications. The experimental results show a significant speedup of 3~4x compared to the software performance on a 2GHz Pentium IV machine, where our RFU logic mapped onto Xilinx Virtex-5 XC5VLX50 only takes up 17% resource.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading (1979)
Sidhu, R., Prasanna, V.K.: Fast RE matching using FPGAs. In: 9th IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 227–238. IEEE Press, Los Alamitos (2001)
Hutchings, B.L., Franklin, R., Carver, D.: Assisting network intrusion detection with reconfigurable hardware. In: 10th IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 111–120. IEEE Press, Los Alamitos (2002)
Clark, C.R., Schimmel, D.E.: Scalable parallel pattern matching on high speed networks. In: 12th IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 249–257. IEEE Press, Los Alamitos (2004)
Sourdis, I., Bispo, J., Cardoso, J.M.P., Vassiliadis, S.: RE Matching in Reconfigurable Hardware. Journal of Signal Processing Systems, 99–121 (October 2007)
Cho, Y., Smith, W.H.M.: Deep packet filter with dedicated logic and read only memories. In: 12th IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 125–134. IEEE Press, Los Alamitos (2004)
Brodie, B.C., Cytron, R.K., Taylor, D.E.: A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching. In: 33rd Annual International Symposium on Computer Architecture, ISCA 2006, pp. 191–202 (2006)
Lin, C.-H., Huang, C.-T., Jiang, C.-P., et al.: Optimization of Pattern Matching Circuits for RE on FPGA. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 15(12), 1303–1310 (2007)
Mitra, A., Najjar, W.A., Bhuyan, L.N.: Compiling PCRE to FPGA for accelerating SNORT IDS. In: ACM/IEEE Symposium on Architectures for Networking and Communications Systems, Orlando, pp. 127–136 (2007)
Moscola, J., Lockwood, J., Loui, R.P., Pachos, M.: Implementation of a content-scanning module for an internet firewall. In: 11th Field-Programmable Custom Computing Machines, pp. 31–38. IEEE Press, Los Alamitos (2003)
Kumar, S., Dharmapurikar, S., Yu, F.: Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In: Proceedings of the SIGCOMM 2006 conference on Applications, technologies, architectures, and protocols for computer communications, October 2006, vol. 36(4), pp. 339–350 (2006)
Emer, J., Ahuja, P., Borch, E., et al.: Asim: A performance model framework. Computer 35(2), 68–76 (2002)
Hopcroft, J.: An nlogn algorithm for minimizing states in a finite automaton. In: Kohavi, J. (ed.) Theory of Machines and Computation, pp. 189–196. Academic, New York (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cong, M. et al. (2010). Pattern-Unit Based Regular Expression Matching with Reconfigurable Function Unit. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds) Computational Science and Its Applications – ICCSA 2010. ICCSA 2010. Lecture Notes in Computer Science, vol 6019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12189-0_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-12189-0_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12188-3
Online ISBN: 978-3-642-12189-0
eBook Packages: Computer ScienceComputer Science (R0)