Prague Stringology Conference 2021
Waltteri Pakalén, Hannu Peltola, Jorma Tarhio and Bruce W. Watson
Pitfalls of Algorithm Comparison
| Abstract: |
| Why is Algorithm A faster than Algorithm B in one comparison, and vice versa in another? In this paper, we review some reasons for such differences in experimental comparisons of exact string matching algorithms. We address issues related to timing, memory management, compilers, tuning/tune-up, validation, and technology development. In addition, we consider limitations of the widely used testing environments, Hume & Sunday and SMART. A part of our observations likely apply to comparisons of other types of algorithms. |
| Download paper: |  |
 |
 |
| PostScript | BibTeX reference |
| Download presentation: |  |