APmap

An Open-Source Compiler for Automata Processors

Journal Article (2021)
Author(s)

Jintao Yu (TU Delft - Computer Engineering)

Muath Abu Lebdeh (TU Delft - Computer Engineering)

Hoang Anh Du Nguyen (TU Delft - Computer Engineering)

M. Taouil (TU Delft - Computer Engineering)

S Hamdioui (TU Delft - Quantum & Computer Engineering)

Research Group
Computer Engineering
Copyright
© 2021 J. Yu, M.F.M. Abu Lebdeh, H.A. Du Nguyen, M. Taouil, S. Hamdioui
DOI related publication
https://doi.org/10.1109/TCAD.2021.3062328
More Info
expand_more
Publication Year
2021
Language
English
Copyright
© 2021 J. Yu, M.F.M. Abu Lebdeh, H.A. Du Nguyen, M. Taouil, S. Hamdioui
Research Group
Computer Engineering
Issue number
1
Volume number
41
Pages (from-to)
196-200
Reuse Rights

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.

Files

License info not available