Research and implementation of the GPU-based LCS algorithm acceleration mechanism

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Tongxin Xuebao Ročník 34; číslo SUPPL.1; s. 9 - 13
Hlavní autoři: Zhang, Chang-Zhi, Mu, Cheng, Huang, Xiao-Hong, Ma, Yan
Médium: Journal Article
Jazyk:čínština
Vydáno: Editorial Department of Journal on Communications 01.09.2013
Témata:
Algorithms
China
CUDA platform
Feature extraction
Feature recognition
GPU acceleration
LCS algorithm
Platforms
protocol feature recognition
Running
String matching
Strings
ISSN:1000-436X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1000-436X
DOI:10.3969/j.issn.1000-436x.2013.z2.003