18410299. FINITE AUTOMATA GLOBAL COUNTER IN A DATA FLOW GRAPH-DRIVEN ANALYTICS PLATFORM HAVING ANALYTICS HARDWARE ACCELERATORS simplified abstract (Microsoft Technology Licensing, LLC)

FINITE AUTOMATA GLOBAL COUNTER IN A DATA FLOW GRAPH-DRIVEN ANALYTICS PLATFORM HAVING ANALYTICS HARDWARE ACCELERATORS

Organization Name

Microsoft Technology Licensing, LLC

Inventor(s)

Rajan Goyal of Saratoga CA (US)

Satyanarayana Lakshmipathi Billa of Sunnyvale CA (US)

FINITE AUTOMATA GLOBAL COUNTER IN A DATA FLOW GRAPH-DRIVEN ANALYTICS PLATFORM HAVING ANALYTICS HARDWARE ACCELERATORS - A simplified explanation of the abstract

This abstract first appeared for US patent application 18410299 titled 'FINITE AUTOMATA GLOBAL COUNTER IN A DATA FLOW GRAPH-DRIVEN ANALYTICS PLATFORM HAVING ANALYTICS HARDWARE ACCELERATORS

Simplified Explanation

The abstract describes a system and methods for performing analytical operations using a hardware-based regular expression engine that operates on a stream of data units based on a finite automata graph.

• The hardware-based regular expression engine is configured to traverse nodes of the finite automata graph until reaching a skip node, where it consumes multiple data units before moving to another node.
• The regular expression accelerator efficiently processes data streams by following the defined path in the finite automata graph.
• This technology enables fast and accurate pattern matching in large datasets.

Potential Applications

This technology can be applied in various fields such as cybersecurity, data mining, and network traffic analysis.

Problems Solved

1. Efficient processing of large data streams for pattern matching. 2. Accelerated performance in analyzing complex data structures.

Benefits

1. Improved speed and accuracy in pattern recognition tasks. 2. Reduction in processing time for analyzing data streams. 3. Enhanced capabilities for real-time data analysis.

Potential Commercial Applications

Optimizing network security systems for faster threat detection and response.

Possible Prior Art

One possible prior art could be the use of software-based regular expression engines for pattern matching tasks. However, the hardware-based approach described in this patent application offers improved efficiency and performance compared to traditional software implementations.

How does this technology compare to other hardware-based accelerators for pattern matching tasks?

This article does not provide a direct comparison with other hardware-based accelerators in the field of pattern matching. Further research is needed to understand the specific advantages and limitations of this technology compared to existing solutions.

What are the potential limitations or constraints of implementing this technology in different computing environments?

The article does not address the potential challenges or constraints of deploying this technology in various computing environments. Further investigation is required to determine the scalability and adaptability of this hardware-based regular expression engine in different settings.

Original Abstract Submitted

System and methods for performing analytical operations are described. A hardware-based regular expression (RegEx) engine performs a regular expression operation on a stream of data units based on a finite automata (FA) graph. Performing includes configuring a regular expression engine of a hardware-based regular expression accelerator to, beginning at a root node in the plurality of nodes of the FA graph, step the regular expression engine through one or more nodes of the FA graph until the regular expression engine arrives at a skip node and to consume, at the skip node, two or more data units from the stream of data units before traversing one of the directional arcs to another node.