Technology beats algorithms (in exact string matching)

Research output: Contribution to journalArticleScientificpeer-review

Researchers

Research units

  • Czech Technical University Prague
  • F-Secure Corp.

Abstract

More than 120 algorithms have been developed for exact string matching within the last 40 years. We show by experiments that the naïve algorithm exploiting SIMD instructions of modern CPUs (with symbols compared in a special order) is the fastest one for patterns of length up to about 50 symbols and extremely good for longer patterns and small alphabets. The algorithm compares 16 or 32 characters in parallel by applying SSE2 or AVX2 instructions, respectively. Moreover, it uses loop peeling to further speed up the searching phase. We tried several orders for comparisons of pattern symbols, and the increasing order of their probabilities in the text was the best.

Details

Original languageEnglish
Pages (from-to)1877–1885
JournalSOFTWARE-PRACTICE AND EXPERIENCE
Volume47
Issue number12
Early online date2017
Publication statusPublished - 2017
MoE publication typeA1 Journal article-refereed

    Research areas

  • AVX2, Exact string matching, SIMD instructions, SSE2

Download statistics

No data available

ID: 14716457