A keyword match processor architecture using content addressable memory

Authors:
Long Bu;John A. Chandy
Affiliations:
University of Connecticut, Storrs, CT;University of Connecticut, Storrs, CT
Venue:
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Year:
2004

Citing 6
Cited 4

A fast string searching algorithm

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Associative Processors and Memories: A Survey

IEEE Micro
Cascading Content-Addressable Memories

IEEE Micro
Sorting and Searching using Ternary CAMs

IEEE Micro
Fast Content-Based Packet Handling for Intrusion Detection

Fast Content-Based Packet Handling for Intrusion Detection

A platform-based SoC design and implementation of scalable automaton matching for deep packet inspection

Journal of Systems Architecture: the EUROMICRO Journal
Deterministic high-speed root-hashing automaton matching coprocessor for embedded network processor

ACM SIGARCH Computer Architecture News - Special issue on the 2006 reconfigurable and adaptive architecture workshop
A fast scalable automaton-matching accelerator for embedded content processors

ACM Transactions on Embedded Computing Systems (TECS)
TURBONFS: turbo nand flash search

Proceedings of the 20th symposium on Great lakes symposium on VLSI

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor element cells, the processor can process arbitrary sized keywords and match input text streams in a single clock cycle. The processor is capable of determining approximate match and providing distance information as well. A 64-word design has been developed using 19000 transistors and it could be expanded to larger sizes easily. Using a modest 0.5 micron process, we are achieving cycle times of 8 ns and the design will scale to smaller feature sizes.