Abstract

String matching algorithms have played critical role in many applications, such as DNA sequence comparison, network intrusion detection systems, and so forth. In this paper, we present a parallel multiple pattern matching method based on general purpose graphic processing units to realize fast string searching. In proposed method, we adopt a bit-parallel pattern comparison concept to accelerates string search to achieve efficient parallel search of multiple patterns of different lengths. In addition, we use CUDA framework to enhance the performance of searching string by leveraging GPU computing power. From the experimental results, the proposed method can achieve higher search throughput than other string matching methods. The proposed method is useful for genome sequence comparison and packet payload filtering.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.