首页 | 官方网站   微博 | 高级检索  
     

基于GPU的位并行多模式串匹配研究
引用本文:赵光南,吴承荣. 基于GPU的位并行多模式串匹配研究[J]. 计算机工程, 2011, 37(14): 265-267. DOI: 10.3969/j.issn.1000-3428.2011.14.090
作者姓名:赵光南  吴承荣
作者单位:复旦大学计算机科学技术学院,上海,200433
摘    要:图形处理器(GPU)具有较强的单一运算能力及高度并行的体系结构。根据上述特点,选择基于位并行技术的多模式串匹配算法M-BNDM,将其移植到GPU上加以实现和优化。通过对需要处理的数据进行预处理,将串匹配的过程简化为更适合CUDA计算数据的位操作。对基于CUDA架构的并行串匹配算法的性能影响因子进行分析。实验结果表明,与同等CPU算法相比,该算法能够获得约十几倍的加速比。

关 键 词:图形处理器  多模式字符串匹配  位并行  M-BNDM算法  加速
收稿时间:2011-03-16

Research on Multiple Pattern String Matching with Bit-parallelism Based on GPU
ZHAO Guang-nan,WU Cheng-rong. Research on Multiple Pattern String Matching with Bit-parallelism Based on GPU[J]. Computer Engineering, 2011, 37(14): 265-267. DOI: 10.3969/j.issn.1000-3428.2011.14.090
Authors:ZHAO Guang-nan  WU Cheng-rong
Affiliation:(School of Computer Science,Fudan University,Shanghai 200433,China)
Abstract:Considering the strong computing ability and a high degree of parallel architecture of Graphic Processing Unit(GPU), the paper chooses one of multiple string match algorithms based on hit-parallelism, called M-BNDM algorithm, which is to be implemented on GPU and optimized. The process for string matching is simplified to bit operation that is more suitable for data computing of Compute Unified Device Architecture (CUDA) through data preprocessing. Experimental result shows the solution is about 10 times faster than equivalent CPU algorithm. Furthermore, some factors that will infect string matching performance are analyzed.
Keywords:Graphic Processing Unit(GPU)  multiple pattern string matching  bit-parallelism  M-BNDM algorithm  speed up
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号