精确串匹配的并行算法研究与实现

Research and Realization on Parallel Exact String Matching

围绕精确串匹配的并行算法展开研究.在基于分布存储的并行机群上,以串匹配的KR(Karp-Rabin)算法为理论基础,选择合适的Hash函数,设计KR的并行串匹配算法,改进了原有算法占机时间长的缺点,从计算时间复杂度和通信时间复杂度两个方面提高了效率.

This paper makes a research on the exact string matching.Based on distributed memory about parallel cluster and the string matching KR algorithm,it selects the appropriate Hash function,designs the parallel string calculating K-R algorithm,and improves the shortcomings about account number of the of machines,thereby raising the efficiency from the time complexity of calculating and the time complexity and communication.