Pattern-unit based regular expression matching with reconfigurable function unit

  • Authors:
  • Ming Cong;Hong An;Lu Cao;Yuan Liu;Peng Li;Tao Wang;Zhi-hong Yu;Dong Liu

  • Affiliations:
  • School of Computer Science and Technology, University of Science and Technology of China, Hefei, China;School of Computer Science and Technology, University of Science and Technology of China, Hefei, China;Intel China Research Center, Beijing, China;Intel China Research Center, Beijing, China;Intel China Research Center, Beijing, China;Intel China Research Center, Beijing, China;Intel China Research Center, Beijing, China;Intel China Research Center, Beijing, China

  • Venue:
  • ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.