{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
