APmap
An Open-Source Compiler for Automata Processors
Jintao Yu (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Muath Abu Lebdeh (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Hoang Anh Du Nguyen (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Mottaqiallah Taouil (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Said Hamdioui (TU Delft - Electrical Engineering, Mathematics and Computer Science)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
A novel type of hardware accelerators called automata processors (APs) have been proposed to accelerate finite-state automata. The bone structure of an AP is a hierarchical routing matrix that connects many memory arrays. With this structure, an AP can process an input symbol every clock cycle, and hence achieve much higher performance compared to conventional architectures. However, the design automation for the APs is not well researched. This article proposes a fully automated tool named APmap for mapping the automata to APs that use a two-level routing matrix. APmap first partitions a large automaton into small graphs and then maps them. Multiple transformations are applied to the automaton by APmap to meet hardware constraints. The experiments on a standard benchmark suite show that our approach leads to around 19% less storage utilization compared to state-of-the-art.