메뉴 건너뛰기




Volumn , Issue , 2012, Pages 129-139

GPU-based NFA implementation for memory efficient high speed regular expression matching

Author keywords

CUDA; Deep packet inspection; GPU; NFA; Pattern matching; Regular expression matching

Indexed keywords

CUDA; DEEP PACKET INSPECTION; GPU; NFA; REGULAR-EXPRESSION MATCHING;

EID: 84863362945     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2145816.2145833     Document Type: Conference Paper
Times cited : (42)

References (30)
  • 4
    • 56749186238 scopus 로고    scopus 로고
    • A hybrid finite automaton for practical deep packet inspection
    • M. Becchi and P. Crowley. A hybrid finite automaton for practical deep packet inspection. In Proceedings of CoNext, 2007.
    • (2007) Proceedings of CoNext
    • Becchi, M.1    Crowley, P.2
  • 5
    • 77954026099 scopus 로고    scopus 로고
    • An improved algorithm to accelerate regular expression evaluation
    • M. Becchi and P. Crowley. An improved algorithm to accelerate regular expression evaluation. In Proceedings of ANCS, 2007.
    • (2007) Proceedings of ANCS
    • Becchi, M.1    Crowley, P.2
  • 6
    • 70350692284 scopus 로고    scopus 로고
    • Efficient regular expression evaluation: Theory to practice
    • M. Becchi and P. Crowley. Efficient regular expression evaluation: Theory to practice. In Proceedings of ANCS, 2008.
    • (2008) Proceedings of ANCS
    • Becchi, M.1    Crowley, P.2
  • 7
    • 70350771139 scopus 로고    scopus 로고
    • Extending finite automata to efficient match perl-compatible regular expressions
    • M. Becchi and P. Crowley. Extending finite automata to efficient match perl-compatible regular expressions. In Proceedings of CoNext, 2008.
    • (2008) Proceedings of CoNext
    • Becchi, M.1    Crowley, P.2
  • 8
    • 56449093380 scopus 로고    scopus 로고
    • A workload for evaluating deep packet inspection architectures
    • M. Becchi, M. Franklin, and P. Crowley. A workload for evaluating deep packet inspection architectures. In Proceedings of IISWC, 2008.
    • (2008) Proceedings of IISWC
    • Becchi, M.1    Franklin, M.2    Crowley, P.3
  • 9
    • 85099173013 scopus 로고    scopus 로고
    • INFAnt: NFA pattern matching on GPGPU devices
    • N. Cascarano, P. Rolando, F. Risso, and R. Sisto. iNFAnt: NFA pattern matching on GPGPU devices. SIGCOMM CCR, 40(5):21.26, 2010.
    • (2010) SIGCOMM CCR , vol.40 , Issue.5 , pp. 21-26
    • Cascarano, N.1    Rolando, P.2    Risso, F.3    Sisto, R.4
  • 10
    • 79960690920 scopus 로고    scopus 로고
    • Bachelor thesis, Institute of Networked Systems (IONS), University of Science and Technology of China, June
    • M. Chen. TCAM-based high speed regular expression matching. Bachelor thesis, Institute of Networked Systems (IONS), University of Science and Technology of China, June 2010.
    • (2010) TCAM-based High Speed Regular Expression Matching
    • Chen, M.1
  • 11
    • 84863351488 scopus 로고    scopus 로고
    • TCAM-based DFA implementation: A novel approach to efficient regular expression matching
    • Institute of Networked Systems, IONS
    • M. Chen, Q. Dong, and K. Peng. TCAM-based DFA implementation: A novel approach to efficient regular expression matching. Technical report, Institute of Networked Systems (IONS), University of Science and Technology of China.
    • Technical Report, University of Science and Technology of China
    • Chen, M.1    Dong, Q.2    Peng, K.3
  • 12
    • 77749340082 scopus 로고    scopus 로고
    • Model-driven autotuning of sparse matrix-vector multiply on GPUs
    • J. W. Choi, A. Singh, and R. W. Vuduc. Model-driven autotuning of sparse matrix-vector multiply on GPUs. In Proceedings of ACM PPoPP, 2010.
    • (2010) Proceedings of ACM PPoPP
    • Choi, J.W.1    Singh, A.2    Vuduc, R.W.3
  • 15
    • 80053994164 scopus 로고    scopus 로고
    • Achieving a single compute device image in OpenCL for multiple GPUs
    • J. Kim, H. Kim, J. H. Lee, and J. Lee. Achieving a single compute device image in OpenCL for multiple GPUs. In Proceedings of ACM PPoPP, 2011.
    • (2011) Proceedings of ACM PPoPP
    • Kim, J.1    Kim, H.2    Lee, J.H.3    Lee, J.4
  • 16
    • 77954013621 scopus 로고    scopus 로고
    • Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
    • S. Kumar, B. Chandrasekaran, J. Turner, and G. Varghese. Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia. In Proceedings of ANCS, 2007.
    • (2007) Proceedings of ANCS
    • Kumar, S.1    Chandrasekaran, B.2    Turner, J.3    Varghese, G.4
  • 18
    • 67650081010 scopus 로고    scopus 로고
    • OpenMP to GPGPU: A compiler framework for automatic translation and optimization
    • S. Lee, S.-J. Min, and R. Eigenmann. OpenMP to GPGPU: a compiler framework for automatic translation and optimization. In Proceedings of ACM PPoPP, 2009.
    • (2009) Proceedings of ACM PPoPP
    • Lee, S.1    Min, S.-J.2    Eigenmann, R.3
  • 19
    • 85076292285 scopus 로고    scopus 로고
    • Fast regular expression matching using small TCAMs for network intrusion detection and prevention systems
    • August
    • C. R. Meiners, J. Patel, E. Norige, E. Torng, and A. X. Liu. Fast regular expression matching using small TCAMs for network intrusion detection and prevention systems. In Proceedings of USENIX Security, August 2010.
    • (2010) Proceedings of USENIX Security
    • Meiners, C.R.1    Patel, J.2    Norige, E.3    Torng, E.4    Liu, A.X.5
  • 20
    • 79960663081 scopus 로고    scopus 로고
    • TCAM-based DFA defiation: A novel approach to fast and scalable regular expression matching
    • K. Peng, Q. Dong, and M. Chen. TCAM-based DFA defiation: A novel approach to fast and scalable regular expression matching. In Proceedings of ACM/IEEE IWQoS, 2011.
    • (2011) Proceedings of ACM/IEEE IWQoS
    • Peng, K.1    Dong, Q.2    Chen, M.3
  • 21
    • 81255150592 scopus 로고    scopus 로고
    • Chain-based DFA defiation for fast and scalable regular expression matching using TCAM
    • K. Peng, S. Tang, Q. Dong, and M. Chen. Chain-based DFA defiation for fast and scalable regular expression matching using TCAM. In Proceedings of ANCS, 2011.
    • (2011) Proceedings of ANCS
    • Peng, K.1    Tang, S.2    Dong, Q.3    Chen, M.4
  • 22
    • 77749337481 scopus 로고    scopus 로고
    • CUDAlign: Using GPU to accelerate the comparison of megabase genomic sequences
    • E. F. O. Sandes and A. C. M. de Melo. CUDAlign: using GPU to accelerate the comparison of megabase genomic sequences. In Proceedings of ACM PPoPP, 2010.
    • (2010) Proceedings of ACM PPoPP
    • Sandes, E.F.O.1    De Melo, A.C.M.2
  • 24
    • 62849094139 scopus 로고    scopus 로고
    • Defiating the big bang: Fast and scalable deep packet inspection with extended finite automata
    • R. Smith, C. Estan, S. Jha, and S. Kong. Defiating the big bang: fast and scalable deep packet inspection with extended finite automata. In Proceedings of ACM SIGCOMM, 2008.
    • (2008) Proceedings of ACM SIGCOMM
    • Smith, R.1    Estan, C.2    Jha, S.3    Kong, S.4
  • 28
    • 34547662263 scopus 로고    scopus 로고
    • Fast and memory-efficient regular expression matching for deep packet inspection
    • F. Yu, Z. Chen, Y. Diao, T. V. Lakshman, and R. H. Katz. Fast and memory-efficient regular expression matching for deep packet inspection. In Proceedings of ANCS, 2006.
    • (2006) Proceedings of ANCS
    • Yu, F.1    Chen, Z.2    Diao, Y.3    Lakshman, T.V.4    Katz, R.H.5
  • 30
    • 80053998590 scopus 로고    scopus 로고
    • GRace: A low-overhead mechanism for detecting data races in GPU programs
    • M. Zheng, V. T. Ravi, F. Qin, and G. Agrawal. GRace: a low-overhead mechanism for detecting data races in GPU programs. In Proceedings of ACM PPoPP, 2011.
    • (2011) Proceedings of ACM PPoPP
    • Zheng, M.1    Ravi, V.T.2    Qin, F.3    Agrawal, G.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.