Name
Abstract | ||
|---|---|---|
Automata Processor (AP) is a special implementation of non-deterministic finite automata that performs pattern matching by exploring parallel state transitions. The implementation typically contains a hierarchical switching network, causing long latency. This paper proposes a methodology to split such a hierarchical switching network into multiple pipelined stages, making it possible to process several input sequences in parallel by using time-division multiplexing. We use a new resistive RAM based AP (instead of known DRAM or SRAM based) to illustrate the potential of our method. The experimental results show that our approach increases the throughput by almost a factor of 2 at a cost of marginal area overhead. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.23919/DATE.2019.8715140 | 2019 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE) |
Keywords | Field | DocType |
time-devision multiplexing, automata, parallel processing | Dram,Computer science,Parallel computing,Finite-state machine,Static random-access memory,Throughput,Time-division multiplexing,Multiplexing,Pattern matching,Resistive random-access memory | Conference |
ISSN | Citations | PageRank |
1530-1591 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jintao Yu | 1 | 6 | 3.17 |
| Hoang Anh Du Nguyen | 2 | 79 | 8.39 |
| Muath Abu Lebdeh | 3 | 7 | 3.13 |
| Mottaqiallah Taouil | 4 | 224 | 33.40 |
| Said Hamdioui | 5 | 887 | 118.69 |