Parallel Bi-dimensional Pattern Matching with Scaling

M. Mohiyuddin, V. Jain, and P. Gupta (India)

Keywords

Parallel Algorithms, BiDimensional Pattern Matching, Scaling, CREW PRAM

Abstract

This paper deals with the problem of bi-dimensional pattern matching with scaling. The problem is to find all occurrences of the m × m pattern in the N × N text, scaled to all natural multiples. We have proposed an efficient parallel algorithm for this problem on CREW-PRAM with p2 processors. It takes 0(N2/p2) time.

Important Links:



Go Back