Design and Analysis of String Matching Algorithm on Distributed Memory Machine
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

陈国良,林洁,顾乃杰.分布式存储的并行串匹配算法的设计与分析.软件学报,2000,11(6):771-778

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 11,1999
  • Revised:June 17,1999
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063