Performance of hardcoded finite automata

Authors:
E. Ketcha Ngassam;Derrick G. Kourie;Bruce W. Watson
Affiliations:
School of Computing, University of South Africa, Pretoria 0003, South Africa;Fastar Research Group, Department of Computer Science, University of Pretoria, Pretoria 0002, South Africa;Fastar Research Group, Department of Computer Science, University of Pretoria, Pretoria 0002, South Africa
Venue:
Software—Practice & Experience - Research Articles
Year:
2006

Citing 10
Cited 1

Very fast LR parsing

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
On a recursive ascent parser

Information Processing Letters
Even faster LR parsing

Software—Practice & Experience
Parsing techniques: a practical guide

Parsing techniques: a practical guide
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Discovering Statistics Using SPSS for Windows: Advanced Techniques for Beginners

Discovering Statistics Using SPSS for Windows: Advanced Techniques for Beginners
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences

Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Hardcoding finite state automata processing

SAICSIT '03 Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Stretching and jamming of automata

SAICSIT '03 Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Preliminary experiments in hardcoding finite automata

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata

A framework for benchmarking FA-based string recognizers

SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the performance of a hardcoded algorithm for recognizing strings of a finite automaton's language and compare it with the use of the more conventional table-driven algorithm. In both cases, performance depends on the finite automaton's dimensions such as alphabet size and the number of states. However, the respective processing mechanisms that influence the performance, in particular cache memory usage, depend on the details of the processor's underlying architecture. In the hardcoded case, the automaton's dimensions determine the size of the code which is, in turn, the primary determinant of the way in which cache memory is used. In the table-driven case, cache memory usage is primarily determined by the way in which portions of the transition table are stored in it. Using statistical regression analysis, we provide multivariate equations to model the observed time efficiency of both methods. The equations obtained are cross-compared and conclusions are drawn. Copyright © 2006 John Wiley & Sons, Ltd.