Abstract

MATOUŠEK Denis, MATOUŠEK Jiří and KOŘENEK Jan. High-speed Regular Expression Matching with Pipelined Memory-based Automata. Proceedings of the 2018 IEEE 26th Annual International Symposium on Field-Programmable Custom Computing Machines. Boulder, CO: IEEE Computer Society, 2018. ISBN 978-1-5386-5522-1.
Publication language:english
Original title:High-speed Regular Expression Matching with Pipelined Memory-based Automata
Title (cs):Vysokorychlostní vyhledávání vzorů popsaných regulárními výrazy pomocí zřetězených automatů reprezentovaných pomocí pamětí
Pages:214-214
Book:Proceedings of the 2018 IEEE 26th Annual International Symposium on Field-Programmable Custom Computing Machines
Conference:The 26th IEEE International Symposium on Field-Programmable Custom Computing Machines
Place:Boulder, CO, US
Year:2018
ISBN:978-1-5386-5522-1
DOI:10.1109/FCCM.2018.00048
Publisher:IEEE Computer Society
Keywords
Regular expression matching, 100 Gbps, 400 Gbps, Delayed Input DFA, Pipelined automata
Annotation
The paper proposes an architecture of a high-speed regular expression (RE) matching system with fast updates of an RE set. The architecture uses highly memory-efficient Delayed Input DFAs (D 2 FAs), which are organized to a processing pipeline. The architecture is designed so that it communicates only locally among its components in order to achieve high frequency even for a large number of parallel matching engines (MEs), which allows scaling throughput to hundreds of gigabits per second (Gbps). The architecture is able to achieve processing throughput of up to 400 Gbps on current FPGA chips.

Your IPv4 address: 3.226.251.81
Switch to https