计算机工程2011,Vol.37Issue(14):265-267,273,4.DOI:10.3969/j.issn.1000-3428.2011.14.090
基于GPU的位并行多模式串匹配研究
Research on Multiple Pattern String Matching with Bit-parallelism Based on GPU
赵光南 1吴承荣1
作者信息
- 1. 复旦大学计算机科学技术学院,上海,200433
- 折叠
摘要
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 bit-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.关键词
图形处理器/多模式字符串匹配/位并行/M-BNDM算法/加速Key words
Graphic Processing Unit(GPU)/ multiple pattern string matching/ bit-parallelism/ M-BNDM algorithm/ speed up分类
自科综合引用本文复制引用
赵光南,吴承荣..基于GPU的位并行多模式串匹配研究[J].计算机工程,2011,37(14):265-267,273,4.