期刊文献+

基于GPU的LCS算法加速机制研究与实现

Research and implementation of the GPU-based LCS algorithm acceleration mechanism
下载PDF
导出
摘要 协议特征识别技术中用到了一种重要的LCS算法,它是一种字符串比对算法,提取出字符串中的最长连续公共子串。然而,通过理论分析和实验表明:这个查找过程是一个时间复杂度较高的运算过程,如果输入的数据分组比较大,那么运行的时间将会非常长,为此不得不控制输入数据分组的大小和数量,这严重限制了所采用样本集的大小。提出了基于GPU对LCS运算实现加速的方法。在此基础上搭建和配置了CUDA平台,在此平台下研究并实现了LCS算法的并行性。通过对LCS算法在CUDA下并行性的研究,有效地加快了LCS算法的运行速度。实验结果表明,GPU下LCS算法的运行效率比CPU有了显著的提高。 The LCS algorithm used in protocol feature recognition is a string matching algorithm to extract the longest string of continuous public substring. However, through theoretical analysis and some experimental situation, it can be seen that this process is a time complexity of higher computing process. If the input data packet is relatively large, the running time will be very long. To this end, the size and number of input packets have to be controled, which severely limits the size of the sample set. A GPU based method for accelerating the LCS algorithm was proposed. The CUDA platform was built and dedoyed and the parallel of LCS algorithm was researched on this platform. By the parallel study of LCS algorithm on the CUDA, the operation speed of the LCS is effectively enhanced. Highly competitive experimental results show that the LCS algorithm in the GPU is more effective and efficient than that in the CPU.
出处 《通信学报》 EI CSCD 北大核心 2013年第S2期9-13,共5页 Journal on Communications
基金 国家自然科学基金资助项目(61003282) 国家CNGI专项基金资助项目:可演进的下一代高智能网络架构研究和实验基金资助项目~~
关键词 协议特征识别 LCS算法 CUDA平台 GPU加速 protocol feature recognition LCS algorithm CUDA platform GPU acceleration
  • 相关文献

参考文献3

二级参考文献12

  • 1Yazdani N,Ozsoyoglu Z M.Sequence matching of images[C]//Proceedings of the IEEE International Conference on Multimedia Computing and Systems,Volume Ⅱ, 1996:53-62.
  • 2Hunt J W,Szymanski T G.A fast algorithm for computing longest common subsequences[J].Communications of the ACM, 1977,20(5): 350-353.
  • 3Sutinen E,Tarhio J.Approximate string matching with ordered qgrams[J].Nordic Journal of Computing, 2004, 11 (4) : 321-343.
  • 4Setubal,Meidanis J.Introduction to computation molecular biology. University of Campinas,Brazil, 1997.
  • 5Apostolico,Guerra C.The Longest Common Subsequenee problem revisited[J].Algorithmica, 1987(2 ) : 315-336.
  • 6Deken.Some limit results for longest common subsequences[J].Discrete Mathematics, 1979,26:17-31.
  • 7Gusfield.Algorithms on strings,trees,and sequences:computer science and computational biology[D].Cambridge:Cambridge University Press, 1997.
  • 8Keceeioglu,Sankoff D.Exact and approximation algorithms for the inversion distance between two permutations[J].Algorithmica,1995, 13: 180-210.
  • 9陈国良.并行算法的设计与分析[M]高等教育出版社,1994.
  • 10肖位枢.图论及其算法[M]航空工业出版社,1993.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部