Efficient string matching on graphics processing unit using bit-parallelism
by Chen Hou; Nan Li; Meng Zhang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 10, No. 4, 2016

Abstract: String matching and regular expression matching have many applications in search engines, antivirus systems, intrusion detection systems, and others. Bit-parallelism is a widely used technique in the design of efficient string matching algorithms. In this paper, we present the design and implementation of string matching algorithms and regular expression matching algorithms on Graphics Processing Units (GPUs) using bit-parallelism. We conduct several experiments to compare the speed of algorithms on CPU and GPU. The results show that the new approach achieves significant improvements on the speed of pattern matching and regular expression matching.

Online publication date: Mon, 08-Aug-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com