We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Parallel Pattern Matching with Scaling.
- Authors
Mongelli, H.; Song, S. W.
- Abstract
Given a text and a pattern, the problem of pattern matching consists of determining all the positions of the text where the pattern occurs. When the text and the pattern are matrices, the matching is termed bidimensional. There are variations of this problem where we allow the matching using a somehow modified pattern. A modification that we will allow is that the pattern can be scaled. We propose a new parallel algorithm for this problem, under the CGM (Coarse Grained Multicomputer) model. This algorithm requires linear local computing time in the input, linear memory and uses only one communication round, during which at most a linear amount of data is exchanged. To the best of our knowledge, there are no known parallel algorithms for the bidimensional pattern matching problem with scaling in the literature. This proposed algorithm was implemented in C, using the PVM interface and was executed on a Parsytec PowerXplorer parallel machine. The experimental results obtained were very promising and showed significant speedups.
- Subjects
PARALLEL processing; PARALLEL algorithms
- Publication
Parallel Processing Letters, 2001, Vol 11, Issue 1, p125
- ISSN
0129-6264
- Publication type
Article
- DOI
10.1142/S0129626401000476