Patent application number | Description | Published |
20100332798 | Digital Processor and Method - A processor subunit for a processor for processing data. The processor subunit includes registers, and at least one functional unit for executing instructions on data. One or more registers of the registers are connected to an input of the at least one functional unit, where each register connected to the input of the at least one functional unit which has an input multiplexer. One or more registers of the registers are connected to an output of the at least one functional unit, where each register connected to the output of the at least one functional unit which has an input multiplexer. At least one output bus is connected to at least one register. At least one input bus is connected to at least one register. The processor subunit may be used in a processor, which may be used in a data streaming accelerator. | 12-30-2010 |
20120195208 | PROGRAMMABLE MULTIFIELD PARSER PACKET - A method of operating a packet parser in a computing system includes providing a configurable packet pointer by the packet parser, the packet pointer configured to index a configurable number of atomic parsing elements, the atomic parsing elements having a configurable size, in a data stream received by the computing system for extraction, wherein the indexed atomic parsing elements are non-contiguous in the data stream; and receiving the extracted indexed atomic parsing elements from the data stream by the packet parser. | 08-02-2012 |
20130262492 | Determination and Handling of Subexpression Overlaps in Regular Expression Decompositions - A computer-implemented method for transforming a finite state automaton (FSA) of a regular expression includes determining, by a computer, a first subexpression R | 10-03-2013 |
20130282648 | DETERMINISTIC FINITE AUTOMATON MINIMIZATION - Deterministic finite automaton (DFA) minimization includes representing a DFA as a data structure including a plurality of states, incoming transitions for each state, and outgoing transitions for each state. A state of the plurality of states is selected as a selected state. The incoming transitions are analyzed for the selected state. A computer determines whether source states of the incoming transitions for the selected state include a pair of equivalent states. The pair of equivalent states is merged based on determining that two of the source states of the incoming transitions for the selected state form the pair of equivalent states. | 10-24-2013 |
20130282649 | DETERMINISTIC FINITE AUTOMATION MINIMIZATION - Deterministic finite automaton (DFA) minimization includes representing a DFA as a data structure including a plurality of states, incoming transitions for each state, and outgoing transitions for each state. A state of the plurality of states is selected as a selected state. The incoming transitions are analyzed for the selected state. A computer determines whether source states of the incoming transitions for the selected state include a pair of equivalent states. The pair of equivalent states is merged based on determining that two of the source states of the incoming transitions for the selected state form the pair of equivalent states. | 10-24-2013 |
Patent application number | Description | Published |
20100085891 | APPARATUS AND METHOD FOR ANALYSING A NETWORK - The invention relates to an apparatus for analysing a network flow, comprising—a parser for extracting flow identification information from the network flow, —a flow metering unit for metering the network flow, —a programmable controller for controlling the flow metering unit and the parser. | 04-08-2010 |
20130144830 | METHOD AND DEVICE FOR DISTRIBUTING PATTERNS TO SCANNING ENGINES FOR SCANNING PATTERNS IN A PACKET STREAM - A method and a device for distributing patterns to scanning engines for scanning packets in a packet stream are provided. The method includes providing a plurality of scanning engines and patterns, calculating a respective distance metric for every pair of patterns, and providing a plurality of distribution functions. Further, the method includes calculating a respective sum of the calculated distance metrics for distributing the patterns for each of the distribution functions, and utilizing the sums for selecting a distribution function of the D distribution functions for distributing the patterns to the M scanning engines. A device for implementing the method is also provided. | 06-06-2013 |
20130262493 | Determination and Handling of Subexpression Overlaps in Regular Expression Decompositions - A computer program product comprising a computer readable storage medium containing computer code that, when executed by a computer, implements a method for transforming a finite state automaton (FSA) of a regular expression, wherein the method includes determining, by a computer, a first subexpression R | 10-03-2013 |