Abstract

Finite State Machines (FSM) are widely used computation models for many application domains. These embarrassingly sequential applications with irregular memory access patterns perform poorly on conventional von-Neumann architectures. The Micron Automata Processor (AP) is an in-situ memory-based computational architecture that accelerates non-deterministic finite automata (NFA) processing in hardware. However, each FSM on the AP is processed sequentially, limiting potential speedups.

Keywords:
Computer science Parallel computing Von Neumann architecture Finite-state machine Automaton Limiting Computation Theoretical computer science Algorithm Programming language Engineering

Metrics

34
Cited By
5.57
FWCI (Field Weighted Citation Impact)
38
Refs
0.97
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Network Packet Processing and Optimization
Physical Sciences →  Computer Science →  Hardware and Architecture
Algorithms and Data Compression
Physical Sciences →  Computer Science →  Artificial Intelligence
semigroups and automata theory
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

Parallel Automata Processor

Arun SubramaniyanReetuparna Das

Journal:   ACM SIGARCH Computer Architecture News Year: 2017 Vol: 45 (2)Pages: 600-612
BOOK-CHAPTER

PARALLEL PATTERN MATCHING USING THE AUTOMATA PROCESSOR

Matt TannerMatt GrimmHarold B. Noyes

WORLD SCIENTIFIC eBooks Year: 2015 Pages: 539-559
JOURNAL ARTICLE

Parallel interval stabbing on the automata processor

Indranil RoyAnkit SrivastavaMatt GrimmSrinivas Aluru

Journal:   Irregular Applications: Architectures and Algorithms Year: 2016 Pages: 10-17
© 2026 ScienceGate Book Chapters — All rights reserved.