Click here to try a web-enabled intro simulation or visit micronautomata.com to sign up for a full preview of the Micron Automata Processor SDK (Software Development Kit) that includes a visual development environment, compiler, design rules checker, regular expression to automata generator and AP simulator. The SDK is also available through membership with the Center for Automata Processing. The Automata Processor implements an NFA (Non-deterministic Finite Automata) in silicon to provide high-speed, comprehensive search and analysis of complex, unstructured data streams. NFA’s are powerful state machines that have been heavily studied by computer scientists. Demo videos that can be viewed here illustrate pattern-matching and counter implementations as well as a BFS tree traversal. Breadth-First Search (BFS) is a key graph algorithm benchmark.
Performance can be incredible as the following video touts 312 trillion Non-deterministic Fiite Automata path comparisons per second. The recently released NASA report that projects computer technology to the year 2030 for CFD (Computational Fluid Dynamics) categorizes in-memory processing is a wild-card that many drastically affect how HPC programs and algorithms are designed.
The following quick tutorial demonstrates the Automata Processor SDK:
Even though the Automata Processor can be packaged in a DIMM form-factor, Micron stresses that the AP (Automata Processor) is not a memory device, but rather is a memory based device.
The University of Virginia and Micron Technology have founded the Center for Automata Processing (CAP) to catalyze the growth of an ecosystem focused on research, application and system development by leveraging the expertise of academic and industrial researchers and fostering collaborations to advance the field of automata computing. CAP membership benefits will include low-cost access to Automata Processor tools and resources, plus training and support in a research and support environment comprised of researchers from multiple institutions and organizations.