DocumentCode :
339798
Title :
Parallel string matching algorithms based on dataflow
Author :
Jin Hwan Park ; George, K.M.
Author_Institution :
Dept. of Comput. Sci., Oklahoma State Univ., Stillwater, OK, USA
Volume :
Track3
fYear :
1999
fDate :
5-8 Jan. 1999
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)+/spl alpha/), O/spl les//spl alpha//spl les/m, where n and m represent lengths of reference and pattern strings (n/spl Gt/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 performances are better than those found in the literature. 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.
Keywords :
computational complexity; data flow computing; parallel algorithms; string matching; exact matching; k-mismatches problems; linear systolic array architecture; parallel algorithms; parallel design; parallel string matching; parallelism; serial design; systolic array hardware; Algorithm design and analysis; Buildings; Computer architecture; Computer science; Design methodology; Ear; Hardware; Pattern matching; Software algorithms; Systolic arrays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems Sciences, 1999. HICSS-32. Proceedings of the 32nd Annual Hawaii International Conference on
Conference_Location :
Maui, HI, USA
Print_ISBN :
0-7695-0001-3
Type :
conf
DOI :
10.1109/HICSS.1999.772830
Filename :
772830
Link To Document :
بازگشت