Input-independent, scalable and fast string matching on the cray XMT

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Villa, Oreste ^a   Daniel, Chavarría Miranda ^a   Maschhoff, Kristyn ^b  

^a PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

^b CRAY INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AHO-CORASICK; CORE SYSTEMS; CUSTOM HARDWARES; FAST STRING MATCHING; INTRUSION DETECTION SYSTEMS; MULTITHREADED; NETWORK APPLICATIONS; ON-LINE CONTENTS; PEAK PERFORMANCE; PERFORMANCE VARIABILITY; PROGRAMMABILITY; SCANNING SPEED; SHARED MEMORY MACHINES; SOFTWARE IMPLEMENTATION; SOFTWARE-BASED; SPAM FILTER; STATE OF THE ART; STRING-SEARCHING; SYSTEM FLEXIBILITY; VARIABLE PERFORMANCE; VIRUS SCANNERS;

COMPUTER VIRUSES; DISTRIBUTED PARAMETER NETWORKS; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); MICROPROCESSOR CHIPS; SEARCH ENGINES;

INTRUSION DETECTION;

EID: 70450077404     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161043     Document Type: Conference Paper

References (24)

1. A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6):333-340, 1975.
2. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
3. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10): 62-72, 1977.
4. A. Broder and M. Mitzenmacher. Network Applications of Bloom Filters: A Survey, 2002.
5. C. Chang and R. Paige. From Regular Expressions to DFA's Using Compressed NFA's. In In Proc. CPM '92, A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Lecture Notes in Computer Science, No. 644, pages 88-108. Springer-Verlag, 1992.
6. D. Chavarría-Miranda, A. Marquez, J. Nieplocha, K. Maschhoff, and C. Scherrer. Early Experience with Out-of-Core Applications on the Cray XMT. In Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, pages 1-8, April 2008.
7. Y. H. Cho and W. H. Mangione-Smith. Deep packet filter with dedicated logic and read only memories. In Field-Programmable Custom Computing Machines, 2004. FCCM 2004. 12th Annual IEEE Symposium on, pages 125-134, April 2004.
8. S. Dharmapurikar, P. Krishnamurthy, T. S. Sproull, and J. W. Lockwood. Deep Packet Inspection using Parallel Bloom Filters. IEEE Micro, 24(1):52-61, 2004.
9. J. Feo, D. Harper, S. Kahan, and P. Konecny. ELDORADO. In CF '05: Proceedings of the 2nd conference on Computing frontiers, pages 28-34, New York, NY, USA, 2005. ACM.
10. B. L. Hutchings, R. Franklin, and D. Carver. Assisting Network Intrusion Detection with Reconfigurable Hardware. In FCCM '02: Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, page 111, Washington, DC, USA, 2002. IEEE Computer Society.
11. T. Katashita, A. Maeda, K. Toda, and Y Yamaguchi. Highly efficient string matching circuit for IDS with FPGA. Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'06), 0:285-286, 2006.
12. J. W. Lockwood, N. Naufel, J. S. Turner, and D. E. Taylor. Reprogrammable network packet processing on the field programmable port extender (FPX). In Proceedings of the ACM Intl. Symposioum on Field Programmable Gate Arrays (FPGA 2001), pages 87-93, 2001.
13. A. Mitra, W. Najjar, and L. Bhuyan. Compiling PCRE to FPGA for accelerating SNORT IDS. In ANCS '07: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems, pages 127-136, New York, NY, USA, 2007. ACM.
14. J. Moscola, J. Lockwood, R. Loui, and M. Pachos. Implementation of a Content-Scanning Module for an Internet Firewall. In Proceedings of IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM), pages 31-38, Napa, CA, USA, Apr. 2003.
15. M. V. Ramakrishna, E. Fu, and E. Bahcekapili. Efficient Hardware Hashing Functions for High Performance Computers. IEEE Trans. Comput., 46(12): 1378-1381, 1997.
16. M. Roesch. Snort: Lightweight Intrusion Detection for Networks. In LISA, pages 229-238, 1999.
17. D. P. Scarpazza, O. Villa, and F. Petrini. Exact multi-pattern string matching on the Cell/B.E. processor. In CF '08: Proceedings of the 2008 conference on Computing frontiers, pages 33-42, New York, NY, USA, 2008. ACM.
18. R. Sidhu and V. Prasanna. Fast regular expression matching using FPGAs. In Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM01), April 2001.
19. I. Sourdis and D. Pnevmatikatos. Fast, Large-Scale String Match for a 10Gbps FPGA-Based Network Intrusion. In Proceedings 13th Conference on Field Programmable Logic and Applications., September 2003.
20. Y Sugawara, M. Inaba, and K. Hiraki. Over 10 Gbps String Matching Mechanism for Multi-stream Packet Scanning Systems. Lecture Notes in Computer Science, Field Programmable Logic and Application, 3203/2004:484-493, 2004.
21. Symantec Global Internet Security Threat Report. White Paper, April 2008.
22. N. Tuck, T. Sherwood, B. Calder, and G. Varghese. Deterministic memory-efficient string matching algorithms for intrusion detection. In Proceedings of the IEEE Infocom Conference, pages 333-340, 2004.
23. O. Villa, D. P. Scarpazza, and F. Petrini. Accelerating Real-Time String Searching with Multicore Processors. Computer, 41(4):42-50, 2008.
24. B. W. Watson. The performance of single-keyword and multiple-keyword pattern matching algorithms. Technical report, Technical Report 19, Eindhoven University of Technology, 1994.