A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments

@article{Ko2013ASP,
  title={A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments},
  author={Yousun Ko and Minyoung Jung and Yo-Sub Han and Bernd Burgstaller},
  journal={International Journal of Parallel Programming},
  year={2013},
  volume={42},
  pages={456-489}
}
We present techniques to parallelize membership tests for Deterministic Finite Automata (DFAs). Our method searches arbitrary regular expressions by matching multiple bytes in parallel using speculation. We partition the input string into chunks, match chunks in parallel, and combine the matching results. Our parallel matching algorithm exploits structural DFA properties to minimize the speculative overhead. Unlike previous approaches, our speculation is failure-free, i.e., (1) sequential… CONTINUE READING