@article{(Open Science Index):https://publications.waset.org/pdf/9309,
	  title     = {A Practical Distributed String Matching Algorithm Architecture and Implementation},
	  author    = {Bi Kun and  Gu Nai-jie and  Tu Kun and  Liu Xiao-hu and  Liu Gang},
	  country	= {},
	  institution	= {},
	  abstract     = {Traditional parallel single string matching algorithms
are always based on PRAM computation model. Those algorithms
concentrate on the cost optimal design and the theoretical speed.
Based on the distributed string matching algorithm proposed by
CHEN, a practical distributed string matching algorithm architecture
is proposed in this paper. And also an improved single string matching
algorithm based on a variant Boyer-Moore algorithm is presented. We
implement our algorithm on the above architecture and the
experiments prove that it is really practical and efficient on distributed
memory machine. Its computation complexity is O(n/p + m), where n
is the length of the text, and m is the length of the pattern, and p is the
number of the processors.},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {1},
	  number    = {10},
	  year      = {2007},
	  pages     = {3261 - 3265},
	  ee        = {https://publications.waset.org/pdf/9309},
	  url   	= {https://publications.waset.org/vol/10},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 10, 2007},