Research Article

Cache Locality-Centric Parallel String Matching on Many-Core Accelerator Chips

Algorithm 2

Balancing length of patterns in STTs.
      Input: , where,
           and includes pattern strings belong to
      Output: , where,
           and has balanced length of patterns
()    Let
()     (i) be the total length of patterns in , where
()     (ii) and be the positions of has-maximum-length and has-minimum-length , respectively
()     (iii) be the limit on the difference between the length of two STTs
()     do
()      while    do
()       Move one pattern at the last position from to
()       Update and
()      Update the total length of patterns in sets of
()   Update the and
() while  ;