Publication result detail

Towards Efficient Field Programmable Pattern Matching Array

KOŠAŘ, V.; KOŘENEK, J.

Original Title

Towards Efficient Field Programmable Pattern Matching Array

English Title

Towards Efficient Field Programmable Pattern Matching Array

Type

Paper in proceedings (conference paper)

Original Abstract

The automata processor, new architecture for pattern matching was introduced recently.
We recognize it as pioneer of new class of field programmable circuits and name
it as Field Programmable Pattern Matching Array. In this paper, we investigate
enhancement of the architecture. We propose usage of fixed deterministic unit
from the NFA-Split architecture as new hard block. Construction process from
set of regular expressions via dual position automaton to final partition on
deterministic and nondeterministic parts is described. Moreover, we investigate
efficiency of deterministic units based on dual position automation. Since
the deterministic unit can implement finite automaton without structural
restrictions we investigated usage of unrestricted finite automaton for DU and
dual position automaton for parts mapped to basic FPPMA elements. According to
the results the proposed DU based on unrestricted finite automaton utilizes up
to 42.43% less State-transition elements than the deterministic unit based
on dual position automaton. According to the results utilization of the
deterministic units provides significant reduction of FPPMA resources for
particular sets of REs. For example, State-transition elements were reduced by
more than 71% for the spyware-put Snort module.

English abstract

The automata processor, new architecture for pattern matching was introduced recently.
We recognize it as pioneer of new class of field programmable circuits and name
it as Field Programmable Pattern Matching Array. In this paper, we investigate
enhancement of the architecture. We propose usage of fixed deterministic unit
from the NFA-Split architecture as new hard block. Construction process from
set of regular expressions via dual position automaton to final partition on
deterministic and nondeterministic parts is described. Moreover, we investigate
efficiency of deterministic units based on dual position automation. Since
the deterministic unit can implement finite automaton without structural
restrictions we investigated usage of unrestricted finite automaton for DU and
dual position automaton for parts mapped to basic FPPMA elements. According to
the results the proposed DU based on unrestricted finite automaton utilizes up
to 42.43% less State-transition elements than the deterministic unit based
on dual position automaton. According to the results utilization of the
deterministic units provides significant reduction of FPPMA resources for
particular sets of REs. For example, State-transition elements were reduced by
more than 71% for the spyware-put Snort module.

Keywords

regular expressions, pattern matching, NFA

Key words in English

regular expressions, pattern matching, NFA

Authors

KOŠAŘ, V.; KOŘENEK, J.

RIV year

2016

Released

26.08.2015

Publisher

IEEE Computer Society

Location

Funchal

ISBN

978-1-4673-8035-5

Book

Proceedings of the 18th Euromicro Conference on Digital Systems Design

Pages from

1

Pages to

8

Pages count

8

BibTex

@inproceedings{BUT119839,
  author="Vlastimil {Košař} and Jan {Kořenek}",
  title="Towards Efficient Field Programmable Pattern Matching Array",
  booktitle="Proceedings of the 18th Euromicro Conference on Digital Systems Design",
  year="2015",
  pages="1--8",
  publisher="IEEE Computer Society",
  address="Funchal",
  doi="10.1109/DSD.2015.97",
  isbn="978-1-4673-8035-5"
}