Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
KOŠAŘ, V.; KOŘENEK, J.
Originální název
Multi-Stride NFA-Split Architecture for Regular Expression Matching Using FPGA
Anglický název
Druh
Stať ve sborníku mimo WoS a Scopus
Originální abstrakt
Regular expression matching is a time critical operation for any network security system. The NFA-Split is an efficient hardware architecture to match a large set of regular expressions at multigigabit speed with efficient FPGA logic utilization. Unfortunately, the matching speed is limited by processing only single byte in one clock cycle. Therefore, we propose new multi-stride NFA-Split architecture, which increases achievable throughput by processing multiple bytes per clock cycle. Moreover, we investigate efficiency of mapping DU to the FPGA logic and propose new optimizations of mapping NFA-Split architecture to the FPGA. These optimizations are able to reduce up to 71.85% of FPGA LUTs and up to 94.18% of BlockRAMs.
Anglický abstrakt
Klíčová slova
NFA, FPGA, Regular Expression Matching
Klíčová slova v angličtině
Autoři
Rok RIV
2015
Vydáno
17.10.2014
Nakladatel
NOVPRESS s.r.o.
Místo
Brno
ISBN
978-80-214-5022-6
Kniha
Proceedings of the 9th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
Strany od
77
Strany do
88
Strany počet
12
URL
https://www.fit.vut.cz/research/publication/10695/
BibTex
@inproceedings{BUT111637, author="Vlastimil {Košař} and Jan {Kořenek}", title="Multi-Stride NFA-Split Architecture for Regular Expression Matching Using FPGA", booktitle="Proceedings of the 9th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science", year="2014", pages="77--88", publisher="NOVPRESS s.r.o.", address="Brno", isbn="978-80-214-5022-6", url="https://www.fit.vut.cz/research/publication/10695/" }
Dokumenty
paper