Parallel String Matching
Summary
We explore the benefits of parallelizing 7 state-of-the-art string matching algorithms. Using SIMD and multi-threading techniques we achieve a significant performance improvement of up to 43.3x over reference implementations and a speedup of up to 16.7x over the string matching program grep. We evaluate our implementations on the smart-corpora and the full human genome data set. We show scalability over number of threads and impact of pattern length.
Bibtex
@inproceedings{,
author={Philip Pfaffe, Martin Tillmann, Sarah Lutteropp, Bernhard Scheirle, Kevin Zerr},
title={Parallel String Matching},
year=2016,
url={http://ps.ipd.kit.edu/downloads/ka_2016_parallel_string_matching.pdf},
abstract={We explore the benefits of parallelizing 7 state-of-the-art string matching algorithms. Using SIMD and multi-threading techniques we achieve a significant performance improvement of up to 43.3x over reference implementations and a speedup of up to 16.7x over the string matching program grep. We evaluate our implementations on the smart-corpora and the full human genome data set. We show scalability over number of threads and impact of pattern length.},
}