High-throughput and concurrent processing of thousands of patterns on each byte of an
input stream is critical for many applications with real-time processing needs, such as …

Regular expressions have been widely used in various application domains such as
network security, machine learning, and natural language processing. Increasing demand …

Non-deterministic Finite Automata (NFA) are space-efficient finite state machines that have
significant applications in domains such as pattern matching and data analytics. In this …

Automata Processing is an important kernel for many application domains, and is
challenging to accelerate using general purpose, von Neumann computers. New research …

Automata processing is an efficient computation model for regular expressions and other
forms of sophisticated pattern matching. The demand for high-throughput and real-time …

Accelerating finite automata processing benefits regular-expression workloads and a wide
range of other applications that do not map obviously to regular expressions, including …

Pattern matching, especially for complex patterns with many variations, is an important task
in many big-data applications and maps well to finite automata. Recently, a variety of …

Deep Packet Inspection (DPI) is a significant network security technique. It examines traffic
workloads by searching for specific rules. Since every byte of packets needs to be examined …

Accelerating finite-state automata benefits several emerging application domains that are
built on pattern matching. In-memory architectures, such as the Automata Processor (AP) …

Problems from a wide variety of application domains can be modeled as “nondeterministic
finite automaton”(NFA) and hence, efficient execution of NFAs can improve the performance …