A bit-parallel algorithm for searching multiple patterns with various lengths
We present an extension of a bit-parallel algorithm for fast string search. The algorithm maximizes the stability of search throughput for multiple patterns of different lengths. Bit and data parallelism are exploited via AVX2 and OpenMP, respectively. Rapid identification of matching patterns is realized by a data padding scheme that regularizes control flow. Stable search throughput is achieved for arbitrary text and patterns that fit into a word.
bit-parallel algorithm string search acceleration avx