Content search system including multiple deterministic finite automaton engines having shared memory resources
US8935270B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | May 13, 2010 |
| Grant date | Jan 13, 2015 |
| Priority date | — |
| Expiry date | Dec 28, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2207/025
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A content search system for determining whether an input string matches one or more of a number of patterns embodied by a deterministic finite automaton (DFA) includes a plurality of DFA engines that simultaneously compare sequential overlapping segments of the input string. The overlap region shared by adjacent pairs of input string segments is of a predetermined size. Initially, the first DFA engine is designated as the master engine, and the remaining DFA engines are designated as slave engines whose state results are speculative. Resolution logic compares the state results of the master engine with the state results of the adjacent slave engine to selectively validate the state results of the successor engine, which upon validation becomes the new master engine.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.