A keyword match processor architecture using content addressable memory

Proceedings of the ACM Great Lakes Symposium on VLSI

Volumn , Issue , 2004, Pages 372-376

  Bu, Long ^a   Chandy, John A ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Keyword matching; Text search hardware

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; INFORMATION ANALYSIS; PROBLEM SOLVING;

DATA STREAMS; KEYWORD MATCHING; PROCESSOR ARCHITECTURE; TEXT SEARCH HARDWARE;

PROGRAM PROCESSORS;

EID: 2942653513     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/988952.989042     Document Type: Conference Paper

References (14)

1. A. Aho and M. Corasick. Efficient string matching: An aid to bibliographic search. Commun. ACM. 18(6):333-343. June 1975.
2. K. Anagnostakis, S. Anlonatos, E. P. Marketos, and M. Polychronakis. E2XB: A domain-specific string matching algorithm for intrustion. detection. In Proceedings of IFIP International Information Security Conference. 2003.
3. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM. 20(10):762-772. Oct. 1977.
4. C. J. Coil, S. Staniford, and J. McAlerney. Towards faster string matching for intrusion detection or exceeding the speed of Snort. In Proceedings of DARPA Information Survivability Conference and Exposition II. pages I:387-373, 2001.
5. M. Fisk and G. Varghese. Fast content-based packet handling for intrusion detection. Technical Report CS2001-0670. Department of Computer Science. University of California, San Diego. May 2001.
6. K. E. Grosspietsch. Associative processors and memories: A survey. IEEE Micro. 12(3), May/June 1992.
7. M. Hirata, H. Yamada, H. Nagai. and K. Takahashi. A versatile data string-search VLSI. IEEE Journal of Solid-State Circuits. 23(2):329-335. Apr. 1988.
8. A. J. McAuley and P. Francis. Fast routing table lookup using cams. In Proceedings of IEEE INFOCOM. volume 3. pages 1382-1391, Mar. 1993.
9. T. Moors and A. Cantoni. Cascading content addressable memories. IEEE Micro, 12(3):56-66. May/June 1992.
10. M. Moromura, J. Toyoura, K. Hirata, H. Ooka, H. Yamada, and T. Enomoto. A 1.2-million transistor. 33 MHz. 20-b dictionary search processor (DISP) ULSI with a 160-kb CAM. IEEE Journal of Solid-State Circuits. 25(5):1158-1164, Oct. 1990.
11. M. Motomura, H. Yamada, and T. Enomoto. A 2k-word dictionary search processor (DISP) with an approximate word search capability. IEEE Journal of Solid-State Circuits. 27(8):883-891, June 1992.
12. A. Mukhopadhyay, Hardware algorithms for string processing. IEEE Computer, pages 508-511, 1980.
13. R. Panigrahy and S. Sharma. Sorting and searching using ternary CAMs. IEEE Micro, 23(1):44-53. January/February 2003.
14. J. P. Wade and C. G. Sodini. A ternary content addressable search engine. IEEE Journal of Solid-State Circuits. 24(4):1003-1013. Aug. 1989.