2019 · 30 citations · 37 references
ComputingBioinformaticsComputer ScienceAlgorithmsComputer ArchitectureMachine LearningAccelerator ArchitectureAutomata TheoryFinite AutomataHardware AccelerationPattern RecognitionRoutingAcceleratorsAutomata LearningFinite Automata TheoryHardware ResourcesPattern MiningRegular Expressions
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 mining, bioinformatics, and machine learning. Existing in-memory automata processing accelerators suffer from inefficient routing architectures. They are either incapable of efficiently place-and-route a highly connected automaton or require an excessive amount of hardware resources.
37
Stable SRAM cell design for the 32 nm node and beyond
L. Chang, David Fried, J. M. Hergenrother et al. · 2005 · 567 citations
Engineering, Computer Engineering, Electrical Engineering +17
THE ABSTRACT THEORY OF AUTOMATA
Russian Mathematical Surveys · 1961 · 481 citations
Haswell: The Fourth-Generation Intel Core Processor
Per Hammarlund, Alberto J. Martinez, David L. Hill et al. · IEEE Micro · 2014 · 243 citations
Engineering, Computer Engineering, Computer Architecture +15