Backend Engine for Parallel String Matching Using Boolean Matrix

In this paper we present new method for exact string matching algorithm based on layered architecture and two-dimensional array. This has applications such as string databases and computational biology. The main use of this method is to reduce the time spent on comparisons of string matching by distributing the data among processors which achieves a linear speedup and requires layered architecture and additionally p * £ processors. In this paper we proposed generalized mapping scheme for distributed computing environment. We introduced efficient dataflow schemes for the exact string matching problems.