串匹配算法的简单并行实现

Simple Parallel Implementation of String Matching Algorithm

结合BM模式匹配算法和并行计算的思想，提出了一种快速的串匹配并行实现策略，该策略将文本串划分成一定长度的子串，将子串分配到不同的处理器中，在各个处理器中分别并行执行BM模式匹配，即便是在最坏的情况下也能达到较好的时间复杂度。

In this paper, a parallel strategy to perform pattern was proposed, This strategy combines the advantages of BM pattern matching algorithms and parallel computing ideas. In this strategy, the text string will be divided into different substrings, the substring was sent to different processor respectively, and then each processor implements the BM pattern matching algorithms at the same time, even in the worst cases, it can achieve a better time complexity.