全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
软件学报  2000 

Design and Analysis of String Matching Algorithm on Distributed Memory Machine
分布式存储的并行串匹配算法的设计与分析

Keywords: String match,KMP (Knuth-Morris-Pratt),distributed algorithm,scalability
串匹配
,KMP(Knuth-Morris-Pratt),分布式算法,可扩放性.

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133