Journal of Software:2000.11(6):771-778

Design and Analysis of String Matching Algorithm on Distributed Memory Machine
CHEN Guo-liang,LIN Jie,GU Nai-jie
Chart / table
Similar Articles
Article :Browse 2948   Download 2897
Received:January 11, 1999    Revised:June 17, 1999
> 中文摘要: 并行串匹配算法的研究大都集中在PRAM(parallel random access machine)模型上,其他更为实际的模型上的并行串匹配算法的研究相对要薄弱得多.该文采用将最优串行算法并行化的技术,利用模式串的周期性质,巧妙地将改进的KMP(Knuth-Morris-Pratt)算法并行化,提出了一个简便、高效且具有良好可扩放性的分布式串匹配算法,其计算复杂度为O(n/p+m),通信复杂度为O(ulogp
Abstract:Parallel string matching algorithms are mainly based on PRAM (parallel random access machine) computation model, while the research on parallel string matching algorithm for other more realistic models is very limited. In this paper, the authors present an efficient and scalable distributed string-matching algorithm is presented by parallelizing the improved KMP (Knuth-Morris-Pratt) algorithm and making use of the pattern period. Its computation complexity is O(n/p+m) and communication time is O(ulogp), wheren is the length of text, m the length of pattern, p the number of processors and u the period length of pattern.
文章编号:     中图分类号:    文献标志码:
基金项目:本文研究得到国家教育部博士点基金(No.9703825)资助。 本文研究得到国家教育部博士点基金(No.9703825)资助。
Foundation items:
Reference text:


CHEN Guo-liang,LIN Jie,GU Nai-jie.Design and Analysis of String Matching Algorithm on Distributed Memory Machine.Journal of Software,2000,11(6):771-778