Well-known theoretical string processing algorithms presented in literature could be not practical, due to the symbol-by-symbol comparisons and processing used.
Modern processors have sse,sse2 (i.t.c.) extensions that allow process multiple data in the same time, as per-symbol.
To be practically optimized, algorithms should use not turing-machine based optimizations (theoretical), but be bazed on modern processors instruction sets.
Monday, March 9, 2009
Making algorithm for strings processing practical
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment