Peak-performance DFA-based string matching on the cell processor

Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Volumn , Issue , 2007, Pages

  Scarpazza, Daniele Paolo ^a   Villa, Oreste ^a,b   Petrini, Fabrizio ^a  

^a PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; COMPUTER HARDWARE; COMPUTER PROGRAMMING; COST EFFECTIVENESS; FINITE AUTOMATA; INTRUSION DETECTION; REAL TIME SYSTEMS;

FINITE-STATE AUTOMATA (DFA); NETWORK LINKS; STRING MATCHING;

PROGRAM PROCESSORS;

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

References (18)

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. C. Chang and R. Paige. From regular expressions to DFAs using compressed NFAs. 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.
5. 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.
6. B. Commentz-Walter. A string matching algorithm fast on the average. In Proceedings of the 6th Colloquium, on Automata, Languages and Programming, pages 118-132, London, UK, 1979. Springer-Verlag.
7. 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.
8. 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.
9. J. A. Kahle, M. N. Day, H. P. Hofstee, C. R. Johns, T. R. Maeurer, and D. Shippy. Introduction to the Cell Multiprocessor. IBM Journal of Research and Development, pages 589-604, July/September 2005.
10. 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.
11. M. Kistler, M. Perrone, and F. Petrini. Cell Processor Inter-connection Network: Built for Speed. IEEE Micro, 25(3), May/June 2006.
12. D. E. Knuth, J. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal of Computing, 6(2):323-350, 1977.
13. 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.
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. 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.
16. I. Sourdis and D. Pnevmatikatos. Fast, large-scale string match for a 10 Gbps FPGA-based network intrusion. In Proceedings 13th Conference on Field Programmable Logic and Applications., September 2003.
17. 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.
18. S. Wu and U. Manber. A fast algorithm for multi-pattern searching. Technical Report TR-94-17, Department of Computer Science, University of Arizona, May 1994.