TY - JFULL AU - Bi Kun and Gu Nai-jie and Tu Kun and Liu Xiao-hu and Liu Gang PY - 2007/11/ TI - A Practical Distributed String Matching Algorithm Architecture and Implementation T2 - International Journal of Computer and Information Engineering SP - 3260 EP - 3265 VL - 1 SN - 1307-6892 UR - https://publications.waset.org/pdf/9309 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 10, 2007 N2 - 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. ER -