loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)
Backend Engine for Parallel String Matching Using Boolean Matrix
Bialystok, Poland
September 13-September 17
ISBN: 0-7695-2554-7
ASCII Text
x 
 
S.Viswanadha Raju, A.Vinaya Babu, M. Mrudula, "Backend Engine for Parallel String Matching Using Boolean Matrix," Parallel Computing in Electrical Engineering, International Conference on, pp. 281-283, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/PARELEC.2006.20,
author = {S.Viswanadha Raju and A.Vinaya Babu and M. Mrudula},
title = {Backend Engine for Parallel String Matching Using Boolean Matrix},
journal ={Parallel Computing in Electrical Engineering, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2554-7},
pages = {281-283},
doi = {http://doi.ieeecomputersociety.org/10.1109/PARELEC.2006.20},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Computing in Electrical Engineering, International Conference on
TI - Backend Engine for Parallel String Matching Using Boolean Matrix
SN - 0-7695-2554-7
SP281
EP283
A1 - S.Viswanadha Raju,
A1 - A.Vinaya Babu,
A1 - M. Mrudula,
PY - 2006
KW - Arrays
KW - Boolean matrix
KW - layered architecture
KW - processor
KW - string matching.
VL - 0
JA - Parallel Computing in Electrical Engineering, International Conference on
ER -
 
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.
Index Terms:
Arrays, Boolean matrix, layered architecture, processor, string matching.
Citation:
S.Viswanadha Raju, A.Vinaya Babu, M. Mrudula, "Backend Engine for Parallel String Matching Using Boolean Matrix," parelec, pp.281-283, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.