A Practical Distributed String Matching Algorithm Architecture and Implementation
| Main Authors: | Bi Kun, Gu Nai-jie, Tu Kun, Liu Xiao-hu, Liu Gang |
|---|---|
| Format: | Article |
| Bahasa: | eng |
| Terbitan: |
, 2007
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/1072517 |
| ctrlnum |
1072517 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><creator>Bi Kun</creator><creator>Gu Nai-jie</creator><creator>Tu Kun</creator><creator>Liu Xiao-hu</creator><creator>Liu Gang</creator><date>2007-10-29</date><description>Traditional parallel single string matching algorithms
are always based on PRAM computation model. Those algorithms
concentrate on the cost optimal design and the theoretical speed.
Based on the distributed string matching algorithm proposed by
CHEN, a practical distributed string matching algorithm architecture
is proposed in this paper. And also an improved single string matching
algorithm based on a variant Boyer-Moore algorithm is presented. We
implement our algorithm on the above architecture and the
experiments prove that it is really practical and efficient on distributed
memory machine. Its computation complexity is O(n/p + m), where n
is the length of the text, and m is the length of the pattern, and p is the
number of the processors.</description><identifier>https://zenodo.org/record/1072517</identifier><identifier>10.5281/zenodo.1072517</identifier><identifier>oai:zenodo.org:1072517</identifier><language>eng</language><relation>doi:10.5281/zenodo.1072516</relation><relation>url:https://zenodo.org/communities/waset</relation><rights>info:eu-repo/semantics/openAccess</rights><rights>https://creativecommons.org/licenses/by/4.0/legalcode</rights><subject>Boyer-Moore algorithm</subject><subject>distributed algorithm</subject><subject>parallel string matching</subject><subject>string matching.</subject><title>A Practical Distributed String Matching Algorithm Architecture and Implementation</title><type>Journal:Article</type><type>Journal:Article</type><recordID>1072517</recordID></dc>
|
| language |
eng |
| format |
Journal:Article Journal |
| author |
Bi Kun Gu Nai-jie Tu Kun Liu Xiao-hu Liu Gang |
| title |
A Practical Distributed String Matching Algorithm Architecture and Implementation |
| publishDate |
2007 |
| topic |
Boyer-Moore algorithm distributed algorithm parallel string matching string matching |
| url |
https://zenodo.org/record/1072517 |
| contents |
Traditional parallel single string matching algorithms
are always based on PRAM computation model. Those algorithms
concentrate on the cost optimal design and the theoretical speed.
Based on the distributed string matching algorithm proposed by
CHEN, a practical distributed string matching algorithm architecture
is proposed in this paper. And also an improved single string matching
algorithm based on a variant Boyer-Moore algorithm is presented. We
implement our algorithm on the above architecture and the
experiments prove that it is really practical and efficient on distributed
memory machine. Its computation complexity is O(n/p + m), where n
is the length of the text, and m is the length of the pattern, and p is the
number of the processors. |
| id |
IOS16997.1072517 |
| institution |
DEFAULT |
| institution_type |
library:public library |
| library |
DEFAULT |
| collection |
DEFAULT |
| city |
DEFAULT |
| province |
DEFAULT |
| repoId |
IOS16997 |
| first_indexed |
2022-06-06T04:12:48Z |
| last_indexed |
2022-06-06T04:12:48Z |
| recordtype |
dc |
| merged_child_boolean |
1 |
| _version_ |
1739496822323281920 |
| score |
17.538404 |