String Matching on a Multicore GPU Using CUDA
- 1 January 2009
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2009 13th Panhellenic Conference on Informatics
Abstract
Graphics processing units (GPUs) have evolved over the past few years from dedicated graphics rendering devices to powerful parallel processors, outperforming traditional central processing units (CPUs) in many areas of scientific computing. The use of GPUs as processing elements was very limited until recently, when the concept of general-purpose computing on graphics processing units (GPGPU) was introduced. GPGPU made possible to exploit the processing power and the memory bandwidth of the GPUs with the use of APIs that hide the GPU hardware from programmers. This paper presents experimental results on the parallel processing for some well known on-line string matching algorithms using one such GPU abstraction API, the Compute Unified Device Architecture (CUDA).Keywords
This publication has 11 references indexed in Scilit:
- High performance discrete Fourier transforms on graphics processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Gnort: High Performance Network Intrusion Detection Using Graphics ProcessorsLecture Notes in Computer Science, 2008
- Cost-effective medical image reconstructionPublished by Association for Computing Machinery (ACM) ,2008
- CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignmentBMC Bioinformatics, 2008
- Scalable Parallel Programming with CUDAQueue, 2008
- A Survey of General‐Purpose Computation on Graphics HardwareComputer Graphics Forum, 2007
- On-line string matching algorithms: survey and experimental resultsInternational Journal of Computer Mathematics, 2001
- A very fast substring search algorithmCommunications of the ACM, 1990
- Practical fast searching in stringsSoftware: Practice and Experience, 1980
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977