Invention Grant
- Patent Title: Multiple step non-deterministic finite automaton matching
- Patent Title (中): 多步非确定性有限自动机匹配
-
Application No.: US13718948Application Date: 2012-12-18
-
Publication No.: US09251440B2Publication Date: 2016-02-02
- Inventor: Michael Ruehle
- Applicant: Intel Corporation
- Applicant Address: US CA Santa Clara
- Assignee: Intel Corporation
- Current Assignee: Intel Corporation
- Current Assignee Address: US CA Santa Clara
- Agency: Barnes & Thornburg LLP
- Main IPC: G06F15/173
- IPC: G06F15/173 ; G06K9/68 ; H04L29/06 ; G06F17/30

Abstract:
Disclosed is a hardware NFA cell array used to find matches to regular expressions or other rules in an input symbol stream. The cell array scans multiple symbols per clock cycle by comparing multiple symbol classes against multiple input symbols per cycle in parallel, signaling bundles of multiple transitions from parent cells to child cells and updating NFA state status by multiple steps. To retain high frequency operation, the cell array will not resolve transition chains from a first cell to a second cell to a third cell in a single cycle. When a chain is required, the cell array takes fewer steps in one cycle to break the chain into separate cycles. To detect multi-transition chains, each cell compares symbol classes to future symbols in advance and back-communicates future match positions to parent cells in the array as launch hazards.
Public/Granted literature
- US20140173603A1 MULTIPLE STEP NON-DETERMINISTIC FINITE AUTOMATON MATCHING Public/Granted day:2014-06-19
Information query