This letter proposes a multithreaded pattern matching algorithm which can efficiently distribute the patterns to be searched on multiple threads to achieve rapid pattern matching operation. The proposed idea is designed to fully exploit thread-level parallelism to enhance searching speed. By distributing a large number of patterns over multiple threads, pattern matching procedure experiences le...

Suppose (S, ∗) is a mathematical structure on a set S. As examples, (S, ∗) might be a topological space on S, a topological group on S, an n-ary operator on S, an n-ary relation on S or a Steiner triple system on S. A similarity mapping on (S, ∗) is a permutation on S that preserves the structure of (S, ∗). Such mappings f : (S, ∗) → (S, ∗) are called by different names. As examples, f might be...