TY - GEN
T1 - GPGPU DFA membership tests
AU - Facchini, Beorn
AU - Ko, Yousun
AU - Jung, Min Young
AU - Burgstaller, Bernd
PY - 2011
Y1 - 2011
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 -