GPGPU DFA membership tests

Beorn Facchini; Yousun Ko; Min Young Jung; Bernd Burgstaller

doi:10.2316/P.2011.757-014

GPGPU DFA membership tests

Beorn Facchini, Yousun Ko, Min Young Jung, Bernd Burgstaller

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Pattern matching is often implemented on the CPU to-day using deterministic finite automata (DFAs). We present methods to efficiently parallelize the DFA membership test on general-purpose graphics processing units (GPGPUs). Our partitioning scheme builds on the work of Holub and Stekr [1]. Our implementations utilize the OpenCL programming model, in which we propose a series of algorithms and related memory size constraints. Experimental results are presented on the effectiveness of these algorithms, yielding GPU speedups between 19x and 39x over the Grep utility in matching PROSITE motifs [2].

Original language	English
Title of host publication	Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011
Pages	73-82
Number of pages	10
DOIs	https://doi.org/10.2316/P.2011.757-014
Publication status	Published - 2011 Dec 1
Event	IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011 - Dallas, TX, United States Duration: 2011 Dec 14 → 2011 Dec 16

Publication series

Name	Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
ISSN (Print)	1027-2658

Other

Other	IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011
Country	United States
City	Dallas, TX
Period	11/12/14 → 11/12/16

All Science Journal Classification (ASJC) codes

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.2316/P.2011.757-014

Fingerprint Dive into the research topics of 'GPGPU DFA membership tests'. Together they form a unique fingerprint.

Cite this

Facchini, B., Ko, Y., Jung, M. Y., & Burgstaller, B. (2011). GPGPU DFA membership tests. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011 (pp. 73-82). (Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems). https://doi.org/10.2316/P.2011.757-014

@inproceedings{1eb6235501554634822935a5384c07d2,

title = "GPGPU DFA membership tests",

abstract = "Pattern matching is often implemented on the CPU to-day using deterministic finite automata (DFAs). We present methods to efficiently parallelize the DFA membership test on general-purpose graphics processing units (GPGPUs). Our partitioning scheme builds on the work of Holub and Stekr [1]. Our implementations utilize the OpenCL programming model, in which we propose a series of algorithms and related memory size constraints. Experimental results are presented on the effectiveness of these algorithms, yielding GPU speedups between 19x and 39x over the Grep utility in matching PROSITE motifs [2].",

author = "Beorn Facchini and Yousun Ko and Jung, {Min Young} and Bernd Burgstaller",

year = "2011",

month = dec,

day = "1",

doi = "10.2316/P.2011.757-014",

language = "English",

isbn = "9780889869073",

series = "Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems",

pages = "73--82",

booktitle = "Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011",

note = "IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011 ; Conference date: 14-12-2011 Through 16-12-2011",

}

Facchini, B, Ko, Y, Jung, MY & Burgstaller, B 2011, GPGPU DFA membership tests. in Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011. Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 73-82, IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011, Dallas, TX, United States, 11/12/14. https://doi.org/10.2316/P.2011.757-014

GPGPU DFA membership tests. / Facchini, Beorn; Ko, Yousun; Jung, Min Young; Burgstaller, Bernd.

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011. 2011. p. 73-82 (Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - GPGPU DFA membership tests

AU - Facchini, Beorn

AU - Ko, Yousun

AU - Jung, Min Young

AU - Burgstaller, Bernd

PY - 2011/12/1

Y1 - 2011/12/1

N2 - Pattern matching is often implemented on the CPU to-day using deterministic finite automata (DFAs). We present methods to efficiently parallelize the DFA membership test on general-purpose graphics processing units (GPGPUs). Our partitioning scheme builds on the work of Holub and Stekr [1]. Our implementations utilize the OpenCL programming model, in which we propose a series of algorithms and related memory size constraints. Experimental results are presented on the effectiveness of these algorithms, yielding GPU speedups between 19x and 39x over the Grep utility in matching PROSITE motifs [2].

AB - Pattern matching is often implemented on the CPU to-day using deterministic finite automata (DFAs). We present methods to efficiently parallelize the DFA membership test on general-purpose graphics processing units (GPGPUs). Our partitioning scheme builds on the work of Holub and Stekr [1]. Our implementations utilize the OpenCL programming model, in which we propose a series of algorithms and related memory size constraints. Experimental results are presented on the effectiveness of these algorithms, yielding GPU speedups between 19x and 39x over the Grep utility in matching PROSITE motifs [2].

UR - http://www.scopus.com/inward/record.url?scp=84856682694&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84856682694&partnerID=8YFLogxK

U2 - 10.2316/P.2011.757-014

DO - 10.2316/P.2011.757-014

M3 - Conference contribution

AN - SCOPUS:84856682694

SN - 9780889869073

T3 - Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

SP - 73

EP - 82

BT - Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011

T2 - IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2011

Y2 - 14 December 2011 through 16 December 2011

ER -