Journal of KIISE (정보과학회 논문지)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

Regular Expression Matching Processor Architecture Supporting Character Class Matching

문자클래스 매칭을 지원하는 정규표현식 매칭 프로세서 구조

  • 윤상균 (연세대학교 컴퓨터정보통신공학부)
  • Received : 2015.05.18
  • Accepted : 2015.08.12
  • Published : 2015.10.15
⟨ Previous Next ⟩

Abstract

Many hardware-based regular expression matching architectures are proposed for high performance matching. In particular, regular expression processors such as ReCPU and SMPU perform pattern matching in a similar approach to that used in general purpose processors, which provide the flexibility when updating patterns. However, these processors are inefficient in performing class matching since they do not provide character class matching capabilities. This paper proposes an instruction set and architecture of a regular expression matching processor, which can support character class matching. The proposed processor can efficiently perform character class matching since it includes character class, character range, and negated character class matching capabilities.

고속 정규표현식 매칭을 수행하기 위한 여러 종류의 정규표현식 매칭 하드웨어 구조가 연구되었다. 특히 프로그램과 같이 패턴의 갱신이 쉽도록 범용 프로세서와 유사한 방식으로 정규표현식 매칭을 수행하는 ReCPU와 SMPU와 같은 정규표현식 프로세서가 연구되었다. 그렇지만 기존의 정규표현식 프로세서들은 문자클래스 매칭을 위한 별도의 기능을 제공하지 않아서 문자클래스 처리에 비효율적이다. 본 논문에서는 문자클래스 매칭을 지원하는 정규표현식 매칭 프로세서의 명령어 집합을 제시하고, 이에 대한 프로세서 구조를 설계 구현한다. 제시된 프로세서는 문자클래스, 문자 범위와 부정 문자클래스 처리 기능을 포함하고 있어서 문자클래스 매칭을 매우 효율적으로 처리할 수 있다.

Keywords

Acknowledgement

Supported by : 한국연구재단

References

  1. R. Sidhu and V. Prasanna, "Fast regular expression matching using FPGAs," IEEE Symp. Field Prog. Custom Computing Machines (FCCM'01), 2001.
  2. C.-H. Lin, C.-T. Huang, C.-P. Jiang, and S.-C. Chang, "Optimization of regular expression pattern matching circuits on FPGA," Proc Conf. Design, Automation and Test in Europe (DATE'06), 2006.
  3. J. C. Bispo, I. Sourdis, J. M. Cardoso, and S. Vassiliadis, "Regular expression matching for reconfigurable packet inspection," IEEE Int. Conf. Field Programmable Technology (FPT'06), 2006.
  4. M. Paolieri, I. Bonesana, M. Santambrogio, "ReCPU: a parallel and pipelined architecture for regular expression matching," Proc. IFIP Int. Conf. VLSI-SoC, 2007.
  5. I. Bonesana, M. Paolieri, and M. Santambrogio, "An adaptable FPGA-based system for regular expression matching," Proc. Conf. Design, Automation and Test in Europe (DATE'08), 2008.
  6. F. Bruschi, M. Paolieri, and V. Rana, "A reconfigurable system based on a parallel and pipelined solution for regular expression matching," Int. Conf. Field Programmable Logic and Appl. (FPL'10), 2010.
  7. Q Li, J. Li, J. Wang, B. Zhao, and Y. Qu, "A pipelined processor architecture for regular expression string matching," Microprocessors and Microsystems, Vol. 36, No. 6, pp. 520-526, Aug. 2012. https://doi.org/10.1016/j.micpro.2012.04.004
  8. B. Ahn, K.H Lee, and S.K. Yun, "Regular expression matching processor supporting efficient repetitions," Journal of KIISE : Computing Practices and Letters, Vol. 19, No. 11, pp. 553-558, Nov. 2013. (in Korean)
  9. T. Arumugam, S. Sezer, D. Burns, and V. Vasu, "High performance custom regular expression processing core," Irish Signal and System Conf. (ISSC'11), 2011.