Parallel String Matching Algorithms Based on Dataflow

Authors:
Jin Hwan Park;K. M. George
Affiliations:
-;-
Venue:
HICSS '99 Proceedings of the Thirty-Second Annual Hawaii International Conference on System Sciences-Volume 3 - Volume 3
Year:
1999

Citing 0
Cited 4

A platform-based SoC design and implementation of scalable automaton matching for deep packet inspection

Journal of Systems Architecture: the EUROMICRO Journal
Deterministic high-speed root-hashing automaton matching coprocessor for embedded network processor

ACM SIGARCH Computer Architecture News - Special issue on the 2006 reconfigurable and adaptive architecture workshop
A fast scalable automaton-matching accelerator for embedded content processors

ACM Transactions on Embedded Computing Systems (TECS)
A neural network string matcher

CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents efficient dataflow schemes for parallel string matching. Two subproblems known as the exact matching and the k-mismatches problems are covered. Three parallel algorithms based on multiple input (and output) streams are presented. Time complexities of these parallel algorithms are O(n / d) + ?), 0 m, where n and m represent lengths of reference and pattern strings (n m) and d represents the number of streams used (the degree of parallelism). We can control the degree of parallelism by using variable number (d) of input (and output) streams. These algorithms present three different methods to design special purpose systolic array hardware for string matching. With linear systolic array architecture, m PEs are needed for serial design and d*m PEs are needed for parallel design.