Instant Access To 100,000+ Essays!

Introduction: This PILOT project is designed to be a proof of concept for "Triple Acceleration." Triple Acceleration (TA), a concept termed and conceived by Dr. Michael Langston, seeks to exploit three areas of Computer Science and Engineering to analyze and compute problems that arise in Graph Theory, sorting, searching, and network flow. The first component of TA focuses on fast, polytime algorithms that apply to Fixed Parameter Tractable problems. The second component is designed to exploit hardware, namely FPGAs, to accelerate the process of reducing input size and obtaining an equivalent instance of bounded size, a problem kernel. The final component of TA is designed to take advantage of UTK's Scalable Intracampus Research Grid (SinRG) to develop an unbounded parallel solution to the bounded search tree. This PILOT project focuses on the hardware component of Triple Acceleration. Background: There exists a class of problems, called the NP-Complete problems, which are not known to be solved in any realistic (polynomial) time span and considered intractable. If we use the most powerful computer, equipped with dedicated hardware and software, depending on the input size, we cannot guarantee a solution to any NP-Comp