Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2881025.2889478acmconferencesArticle/Chapter ViewAbstractPublication PagesancsConference Proceedingsconference-collections
poster

ParaRegex: Towards Fast Regular Expression Matching in Parallel

Published: 17 March 2016 Publication History
  • Get Citation Alerts
  • Abstract

    In this paper, we propose ParaRegex, a novel approach for fast parallel regular expression matching. ParaRegex is a framework that implements data-parallel regular expression matching for deterministic finite automaton based methods. Experimental evaluation shows that ParaRegex produces a fast matching engine with speeds of up to 6 times compared to sequential implementations on a commodity 8-thread workstation.

    References

    [1]
    J. Holub and S. Stekr. On parallel implementations of deterministic finite automata. In Implementation and Application of Automata, pages 54--64, 2009.
    [2]
    Y. Ko, M. Jung, Y.-S. Han, and B. Burgstaller. A speculative parallel dfa membership test for multicore, simd and cloud computing environments. International Journal of Parallel Programming, 42(3):456--489, 2014.
    [3]
    R. E. Ladner and M. J. Fischer. Parallel prefix computation. Journal of the ACM (JACM), 27(4):831--838, 1980.
    [4]
    Regular expression processor. http://regex.wustl.edu/.
    [5]
    M. Becchi and P. Crowley. An improved algorithm to accelerate regular expression evaluation. In Proceedings of the 3rd ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), pages 145--154, 2007.

    Index Terms

    1. ParaRegex: Towards Fast Regular Expression Matching in Parallel

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      ANCS '16: Proceedings of the 2016 Symposium on Architectures for Networking and Communications Systems
      March 2016
      148 pages
      ISBN:9781450341837
      DOI:10.1145/2881025
      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 17 March 2016

      Check for updates

      Author Tags

      1. DFA
      2. deep inspection
      3. parallelism
      4. regular expression matching

      Qualifiers

      • Poster

      Conference

      ANCS '16

      Acceptance Rates

      ANCS '16 Paper Acceptance Rate 12 of 58 submissions, 21%;
      Overall Acceptance Rate 88 of 314 submissions, 28%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 131
        Total Downloads
      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics

      Citations

      View Options

      Get Access

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media