This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Signature Searching in a Networked Collection of Files
May 2014 (vol. 25 no. 5)
pp. 1339-1348
Thomas G. Robertazzi, Department of Electrical and Computer Engineering, Stony Brook University,
Zhongwen Ying, Department of Electrical and Computer Engineering, Stony Brook University ,
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. Related to this is string matching. 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.
Index Terms:
Vegetation,Program processors,Approximation algorithms,Signal processing algorithms,Distributed databases,Hypercubes,hypercube networks,Database search,signatures,tree networks,mesh networks
Citation:
Thomas G. Robertazzi, Zhongwen Ying, "Signature Searching in a Networked Collection of Files," IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 5, pp. 1339-1348, May 2014, doi:10.1109/TPDS.2013.258
Usage of this product signifies your acceptance of the Terms of Use.