Exploring the design space of programmable regular expression matching accelerators

被引:6
作者
Atasu, Kubilay [1 ]
Polig, Raphael [1 ]
Rohrer, Jonathan [1 ]
Hagleitner, Christoph [1 ]
机构
[1] IBM Res Zurich, CH-8803 Ruschlikon, Switzerland
关键词
Regular expression matching; Integer linear programming; Simulated annealing; Network intrusion detection; Design optimization; Hardware accelerators; Compilers; Programmability; ARCHITECTURE;
D O I
10.1016/j.sysarc.2013.08.006
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
State-of-the-art regular expression (regex) accelerators combine parallel programmable state machines with cascaded, wide-issue instruction processors to improve the storage efficiency and the processing rates, while preserving the programmability. The pattern-matching engine (PME) included on the IBM PowerEN (TM) (Edge-of-Network) processor is one such design, and can be used as an architectural template for a broad design-space exploration. The regex compiler is a key component of such an exploration, involving sophisticated transformations to map large sets of complex regexs to the memory contents and the configuration registers of the accelerator hardware. The design space is explored by varying the main microarchitectural parameters, including the memory size, the number of parallel state machines, and the parameters of the instruction processor. While the design-space exploration confirms the main architectural choices of the PME, it also shows that further optimization is possible by eliminating the bottlenecks in the instruction dispatch mechanisms, which results in an up to 50% reduction in the storage requirements. The design-space exploration utilizes a parameterizable and synthesizable hardware model to evaluate the effects the microarchitectural choices have on the chip area and operating frequency. The synthesis results demonstrate the scalability of the optimization chosen and the need to incorporate these choices into future regex accelerator architectures. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:1184 / 1196
页数:13
相关论文
共 30 条
[1]  
Ahuja R., 1993, NETWORK FLOWS THEORY
[2]  
[Anonymous], P 9 ANN IEEE S FIELD
[3]  
[Anonymous], INTRO AUTOMATA THEOR
[4]  
[Anonymous], P IPDPS
[5]  
[Anonymous], P CONEXT
[6]  
[Anonymous], COMPUTERS INTRACTABI
[7]  
[Anonymous], P PACT
[8]  
Baker ZacharyK., 2006, Proceedings of Field Programmable Logic and Applications (FPL), P1
[9]   A methodology for synthesis of efficient intrusion detection systems on FPGAs [J].
Baker, ZK ;
Prasanna, VK .
12TH ANNUAL IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS, 2004, :135-144
[10]  
Becchi M., 2007, Proceedings of the 3rd ACM/IEEE Symposium on Architecture for Networking and Communications Systems, P145, DOI DOI 10.1145/1323548.1323573