Journal of the ACM (JACM)
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Distributed pattern matching using finite automata
Journal of Automata, Languages and Combinatorics
Approximate String Matching by Finite Automata
CAIP '95 Proceedings of the 6th International Conference on Computer Analysis of Images and Patterns
String Matching with Differences by Finite Automata
ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2
Non-blocking parallel subset construction on shared-memory multicore architectures
AusPDC '13 Proceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 140
Data-parallel finite-state machines
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments
International Journal of Parallel Programming
| Hi-index | 0.00 |
We present implementations of parallel DFA run methods and find whether and under what conditions is worthy to use the parallel methods of simulation of run of finite automata. First, we introduce the parallel DFA run methods for general DFA, which are universal, but due to the dependency of simulation time on the number of states |Q | of automaton being run, they are suitable only for run of automata with the smaller number of states. Then we show that if we apply some restrictions to properties of automata being run, we can reach the linear speedup compared to the sequential simulation method. We designed methods benefiting from k -locality that allows optimum parallel run of exact and approximate pattern matching automata. Finally, we show the results of experiments conducted on two types of parallel computers (Cluster of workstations and Symmetric shared-memory multiprocessors).