reduction in cost of the hare
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. 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
Dual Port RAM Dual Port Ram modules were needed as the Pilchard's FPGA operates on slower internal clock speed. The DPRam core was generated using Xilinx's CoreGen and included the enable option. For consistency, Port A was designated to manipulate data on-chip, working on a slower, internal clock. Port B was designated for data transfer between the host and the FPGA using the faster, host clock.
Some topics in this essay:
Vertex Cover,
Arrays FPGA,
Acceleration Background,
Parameter Tractable,
Grid SinRG,
Graph Theory,
Language VHDL,
Parameter Tractability,
vertex cover,
Introduction PILOT,
fixed parameter,
ECE Department,
triple acceleration,
fixed parameter tractable,
parameter tractable,
bounded size,
pilot project,
component ta,
set vertices,
graph vertex,
objective pilot,
graph vertex cover,
Join now to see the rest of the essay!
Approximate Word count = 1601
Approximate Pages = 6 (250 words per page double spaced)
More Essays on reduction in cost of the hare Professional Papers: |
Join Now
(Credit Card)
|
Join Now
(Online Check)
|
Join Now
(Phone 1-900)
|
CUSTOMER SERVICES
| |
|