[Back]


Talks and Poster Presentations (with Proceedings-Entry):

M. Jung, J. Park, J. Blieberger, B. Burgstaller:
"Parallel Construction of Simultaneous Deterministic Finite Automata on Shared-memory Multicores";
Talk: International Conference on Parallel Processing, Bristol; 2017-08-14 - 2017-08-17; in: "Proceedings of the 46th International Conference on Parallel Processing (ICPP-2017)", IEEE, (2017), ISSN: 2332-5690; 271 - 281.



English abstract:
String pattern matching with finite automata (FAs) is a well-established method across many areas in computer science. Until now, data dependencies inherent in the pattern matching algorithm have hampered effective parallelization. To overcome the dependency-constraint between subsequent matching steps, simultaneous deterministic finite automata (SFAs) have been recently introduced. Although an SFA facilitates parallel FA matching, SFA construction itself is limited by the exponential state-growth problem, which makes sequential SFA construction intractable for all but the smallest problem sizes.In this paper, we propose several optimizations to leverage parallelism, improve cache and memory utilization and greatly reduce the processing steps required to construct an SFA. We introduce fingerprints and hashing for efficient comparisons of SFA states. Kernels of 86 SIMD-instructions facilitate cache-locality and leverage data-parallelism with the construction of SFA states. Our parallelization for shared-memory multicores employs lock-free synchronization to minimize cache-coherence overhead. Our dynamic work-partitioning scheme employs work-stealing with thread-local work-queues. The structural properties of FAs allow efficient compression of SFA states. Our construction algorithm dynamically switches to in-memory compression of SFA states for problem sizes which approach the main memory size limit of a given system.We evaluate our approach with patterns from the PROSITE protein database. We achieve speedups of up to 312 on a 64-core AMD system and 193 on a 44-core (88 hyperthreads) Intel system. Our SFA construction algorithm shows scalability on both evaluation platforms.


"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1109/ICPP.2017.36



Related Projects:
Project Head Johann Blieberger:
SAJiTcore++


Created from the Publication Database of the Vienna University of Technology.