To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

1. GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmai l.com
Signature Searching in a Networked Collection of Files
Abstract
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 spee dup, and
graphical results are provided.
Existing system
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).

2. Proposed system
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.
SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
 Processor - Pentium –IV
 Speed - 1.1 Ghz
 RAM - 256 MB(min)
 Hard Disk - 20 GB
 Key Board - Standard Windows Keyboard
 Mouse - Two or Three Button Mouse
 Monitor - SVGA
SOFTWARE CONFIGURATION:-
 Operating System : Windows XP
 Programming Language : JAVA
 Java Version : JDK 1.6 & above.