Abstract
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).
This research has been partially supported by the Ministry of Education, Youth and Sports under research program MSM 6840770014 and the Czech Science Foundation as project No. 201/09/0807.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Černý, J.: Poznámka k homogénnym experimentom s konečnými automatmi. Mat. fyz. čas. SAV 14, 208–215 (1964)
Černý, J., Pirická, A., Rosenauerová, B.: On directable automata. Kybernetika 7(4), 289–297 (1971)
Holub, J., Iliopoulos, C.S., Melichar, B., Mouchard, L.: Distributed pattern matching using finite automata. J. Autom. Lang. Comb. 6(2), 191–204 (2001)
Holub, J.: Reduced nondeterministic finite automata for approximate string matching. In: Holub, J. (ed.) Proceedings of the Prague Stringologic Club Workshop 1996, Czech Technical University in Prague, Czech Republic, pp. 19–27. Collaborative Report DC–96–10 (1996)
Holub, J.: Finite automata implementations considering CPU cache. Acta Polytechnica 47(6), 51–55 (2007)
Ladner, R.E., Fisher, M.J.: Parallel prefix computation. J. Assoc. Comput. Mach. 27(4), 831–838 (1980)
Melichar, B.: Approximate string matching by finite automata. In: Hlaváč, V., Šára, R. (eds.) CAIP 1995. LNCS, vol. 970, pp. 342–349. Springer, Heidelberg (1995)
Melichar, B.: String matching with k differences by finite automata. In: Proceedings of the 13th International Conference on Pattern Recognition, Vienna, Austria, vol. II, pp. 256–260. IEEE Computer Society Press, Los Alamitos (1996)
Ngassam, E.K., Kourie, D.G., Watson, B.W.: Reordering finite automatata states for fast string recognition. In: Holub, J., Šimánek, M. (eds.) Proceedings of the Prague Stringology Conference 2005, Czech Technical University in Prague, Czech Republic, pp. 69–80 (2005)
Ngassam, E.K., Kourie, D.G., Watson, B.W.: On implementation and performance of table-driven DFA-based string processors. In: Holub, J., Žďárek, J. (eds.) Proceedings of the Prague Stringology Conference 2006, Czech Technical University in Prague, Czech Republic, pp. 108–122 (2006)
Thompson, K.: Regular expression search algorithm. Commun. ACM 11, 419–422 (1968)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holub, J., Štekr, S. (2009). On Parallel Implementations of Deterministic Finite Automata. In: Maneth, S. (eds) Implementation and Application of Automata. CIAA 2009. Lecture Notes in Computer Science, vol 5642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02979-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-02979-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02978-3
Online ISBN: 978-3-642-02979-0
eBook Packages: Computer ScienceComputer Science (R0)