The Community for Technology Leaders
Parallel Computing in Electrical Engineering, 2004. International Conference on (2006)
Bialystok, Poland
Sept. 13, 2006 to Sept. 17, 2006
ISBN: 0-7695-2554-7
pp: 281-283
S.Viswanadha Raju , GRRIET, India
A.Vinaya Babu , JNT University, India
M. Mrudula , GRRIET, India
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.
Arrays, Boolean matrix, layered architecture, processor, string matching.

A. Babu, S. Raju and M. Mrudula, "Backend Engine for Parallel String Matching Using Boolean Matrix," International Symposium on Parallel Computing in Electrical Engineering(PARELEC), Bialystok, 2006, pp. 281-283.
95 ms
(Ver 3.3 (11022016))