By Topic

String Matching on a Multicore GPU Using CUDA

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Charalampos S. Kouzinopoulos ; Dept. of Appl. Inf., Univ. of Macedonia, Thessaloniki, Greece ; Konstantinos G. Margaritis

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

Published in:

Informatics, 2009. PCI '09. 13th Panhellenic Conference on

Date of Conference:

10-12 Sept. 2009