In r e cent day’s parallel string matching problem catch the attention of so many researchers becauseof the importance in different applications like IRS, Genome sequence, data cleaning etc.,. While it is veryeasily stated and many of the simple algorithms perform very well in practice, numerous works have beenpublished on the subject and research is still very active. In this paper we propose a omega parallelcomputing model for parallel string matching. The algorithm is designed to work on omega model pa rallelarchitecture where text is divided for parallel processing and special searching at division point is required forconsistent and complete searching. This algorithm reduces the number of comparisons and parallelizationimproves the time efficiency. Experimental results show that, on a multi - processor system, the omega modelimplementation of the proposed parallel string matching algorithm can reduce string matching time.