基于MPI + OpenMP的KMP算法实现

Duan Geng, Weichang Shen, J. Cui, Lin Quan
{"title":"基于MPI + OpenMP的KMP算法实现","authors":"Duan Geng, Weichang Shen, J. Cui, Lin Quan","doi":"10.1109/FSKD.2012.6234095","DOIUrl":null,"url":null,"abstract":"KMP algorithm is a common method of string matching. In view of the characteristics of the string matching and cluster, this article uses MPI + OpenMP hybrid programming model; and KMP algorithm was improved to statistics the number of target words appearing in parallel. Experiments show that the parallel algorithm improves effectively the matching speed, and is higher utilization with memory and less communication time than pure MPI.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The implementation of KMP algorithm based on MPI + OpenMP\",\"authors\":\"Duan Geng, Weichang Shen, J. Cui, Lin Quan\",\"doi\":\"10.1109/FSKD.2012.6234095\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"KMP algorithm is a common method of string matching. In view of the characteristics of the string matching and cluster, this article uses MPI + OpenMP hybrid programming model; and KMP algorithm was improved to statistics the number of target words appearing in parallel. Experiments show that the parallel algorithm improves effectively the matching speed, and is higher utilization with memory and less communication time than pure MPI.\",\"PeriodicalId\":337941,\"journal\":{\"name\":\"International Conference on Fuzzy Systems and Knowledge Discovery\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Fuzzy Systems and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FSKD.2012.6234095\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Fuzzy Systems and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2012.6234095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

KMP算法是一种常用的字符串匹配方法。针对字符串匹配和聚类的特点,本文采用MPI + OpenMP混合编程模型;改进KMP算法,统计目标词并行出现的数量。实验表明,该算法有效地提高了匹配速度,并且比纯MPI算法具有更高的内存利用率和更少的通信时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The implementation of KMP algorithm based on MPI + OpenMP
KMP algorithm is a common method of string matching. In view of the characteristics of the string matching and cluster, this article uses MPI + OpenMP hybrid programming model; and KMP algorithm was improved to statistics the number of target words appearing in parallel. Experiments show that the parallel algorithm improves effectively the matching speed, and is higher utilization with memory and less communication time than pure MPI.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信