Backend Engine for Parallel String Matching Using Boolean Matrix

Author

Raju, S. Viswanadha ; Babu, A. Vinaya ; Mrudula, M.

Author_Institution

Dept. of Comput. Sci., GRRIET, Hyderabad

fYear

2006

fDate

13-17 Sept. 2006

Firstpage

281

Lastpage

283

Abstract

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

Keywords

Boolean functions; data flow computing; matrix algebra; string matching; Boolean matrix; backend engine; computational biology; distributed computing environment; generalized mapping scheme; layered architecture; parallel string matching algorithm; string databases; two-dimensional array; Computer architecture; Computer science; Databases; Engines; Information retrieval; Network servers; Pattern matching; Physics computing; Resource management; Sequences; Arrays; Boolean matrix; architecture; layered; processor; string matching.;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Computing in Electrical Engineering, 2006. PAR ELEC 2006. International Symposium on

Conference_Location

Bialystok

Print_ISBN

0-7695-2554-7

Type

conf

DOI

10.1109/PARELEC.2006.20

Filename

1698674