Conference paper Open Access

Time-division Multiplexing Automata Processor

Jintao Yu; Hoang Anh Du Nguyen; Muath Abu Lebdeh; Mottaqiallah Taouil; Said Hamdioui

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.

Files (627.6 kB)
Name Size
tdm_automata_postprint.pdf
md5:e6f0231db1cd4426aa201d27ae8b7723
627.6 kB Download
4
6
views
downloads
All versions This version
Views 44
Downloads 66
Data volume 3.8 MB3.8 MB
Unique views 33
Unique downloads 55

Share

Cite as