DYNAMIC ALLOCATION OF FINITE AUTOMATA STATES FOR FAST STRING RECOGNITION
2006 ◽
Vol 17
(06)
◽
pp. 1307-1323
◽
Keyword(s):
The spatial and temporal locality of reference on which cache memory relies to minimize cache swaps, is exploited to design a new algorithm for finite automaton string recognition. It is shown that the algorithm, referred to as the Dynamic State Allocation algorithm outperforms the traditional table-driven algorithm for strings that tend to repeatedly access the same set of states, provided that the string is long enough to amortize the allocation cost. Further improvements on the algorithm result in even better performance.
2020 ◽
Vol 31
(04)
◽
pp. 527-538
2005 ◽
Vol 16
(05)
◽
pp. 1027-1038
◽
2012 ◽
Vol 22
(03)
◽
pp. 1250020
Keyword(s):
2007 ◽
Vol 18
(06)
◽
pp. 1407-1416
◽
2019 ◽
Vol 53
(1-2)
◽
pp. 19-35
◽
Keyword(s):
2007 ◽
Vol 13
(3)
◽
pp. 305-339
◽
Keyword(s):
2014 ◽
Vol 25
(07)
◽
pp. 877-896
◽