%0 Journal Article
%T Design and Analysis of String Matching Algorithm on Distributed Memory Machine<br>分布式存储的并行串匹配算法的设计与分析
%A CHEN Guo-liang
%A LIN Jie
%A GU Nai-jie
%A <br>陈国良
%A 林洁
%A 顾乃杰
%J 软件学报
%D 2000
%I 
%X 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.
%K String match
%K KMP (Knuth-Morris-Pratt)
%K distributed algorithm
%K scalability<br>串匹配
%K KMP(Knuth-Morris-Pratt)
%K 分布式算法
%K 可扩放性.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=C7D9BDD54EF1A418&yid=9806D0D4EAA9BED3&vid=708DD6B15D2464E8&iid=B31275AF3241DB2D&sid=E3691231514F8E11&eid=0358FC3DBCE8E14D&journal_id=1000-9825&journal_name=软件学报&referenced_num=6&reference_num=7