skip to main content
poster

Exploring different automata representations for efficient regular expression matching on GPUs

Published:23 February 2013Publication History
Skip Abstract Section

Abstract

Regular expression matching is a central task in several networking (and search) applications and has been accelerated on a variety of parallel architectures. All solutions are based on finite automata (either in deterministic or non-deterministic form), and mostly focus on effective memory representations for such automata. Recently, a handful of work has proposed efficient regular expression matching designs for GPUs; however, most of them aim at achieving good performance on small datasets. Nowadays, practical solutions must support the increased size and complexity of real world datasets. In this work, we explore the deployment and optimization of different GPU designs of regular expression matching engines, focusing on large datasets containing a large number of complex patterns.

References

  1. N. Cascarano et al. iNFAnt: NFA Pattern Matching on GPGPU Devices. In ACM SIGCOMM Computer Communication Review, vol. 40 Num. 5, pp. 21--26, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Becchi et al. An Improved Algorithm to Accelerate Regular Expression Evaluation. In Proc. of ANCS 2007, pp. 145--154, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. F. Yu et al. Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection. In Proc. of ANCS 2006, pp. 93--102, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Becchi et al. A Workload for Evaluating Deep Packet Inspection Architectures. In Proc. of IISWC 2008, pp. 79--89, 2008.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Exploring different automata representations for efficient regular expression matching on GPUs

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM SIGPLAN Notices
      ACM SIGPLAN Notices  Volume 48, Issue 8
      PPoPP '13
      August 2013
      309 pages
      ISSN:0362-1340
      EISSN:1558-1160
      DOI:10.1145/2517327
      Issue’s Table of Contents
      • cover image ACM Conferences
        PPoPP '13: Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
        February 2013
        332 pages
        ISBN:9781450319225
        DOI:10.1145/2442516

      Copyright © 2013 Authors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 23 February 2013

      Check for updates

      Qualifiers

      • poster

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!