A signature is a data pattern of interest in a large data file or set of large data files. Such signatures that need to be found arise in applications such as DNA sequence analysis, network intrusion detection, biometrics, large scientific experiments, speech recognition and sensor networks. More specifically we envision a problem where long linear data files (i.e flat files) contain multiple signatures that are to be found using a multiplicity of processors (parallel processor). This paper evaluates the performance of finding signatures in files residing in the nodes of parallel processors configured as trees, two dimensional meshes and hypercubes. We assume various combinations of sequential and parallel searching. A unique feature of this work is that it is assumed that data is pre-loaded onto processors, as may occur in practice, thus load distribution time need not be accounted for. Elegant expressions are found for average signature searching time and speedup, and graphical results are provided. It has been demonstrated that the expected search time for signatures in a wide variety of search scenarios for tree, mesh networks. This work is of interest in a wide variety of applied areas involving signature searching. Here we are going to compare the two types of network and evaluate the performance of two networks. It is used in some applications such as signature searching occurs in network security, signal processing, medicine, image processing, and sensor technology and many other fields.