Sciweavers

40 search results - page 3 / 8
» A NFA-based programmable regular expression match engine
Sort
View
ICS
2010
Tsinghua U.
13 years 10 months ago
Small-ruleset regular expression matching on GPGPUs: quantitative performance analysis and optimization
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
Jamin Naghmouchi, Daniele Paolo Scarpazza, Mladen ...
IISWC
2008
IEEE
13 years 12 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley
CCR
2010
151views more  CCR 2010»
13 years 3 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...
PAM
2010
Springer
14 years 11 days ago
Network DVR: A Programmable Framework for Application-Aware Trace Collection
Network traces are essential for a wide range of network applications, including traffic analysis, network measurement, performance monitoring, and security analysis. Existing cap...
Chia-Wei Chang, Alexandre Gerber, Bill Lin, Subhab...
ICS
2009
Tsinghua U.
14 years 10 days ago
High-performance regular expression scanning on the Cell/B.E. processor
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
Daniele Paolo Scarpazza, Gregory F. Russell