Simple Parallel Implementation of String Matching Algorithm

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.