About 20 to 50 times FPGA acceleration of optimization problem solution versus 10,000 times faster with Dwave quantum computer

A SIMD tabu search, (which relates to the optimization problem which can be solved 10,000 times faster on an adiabatic quantum computer) was accelerated by 20 to 45 times over a general purpose CPU.

FPGA acceleration using hardware encoding of algorithms gets a typical 3 to 200 times acceleration depending upon how well the problem fits.

What applications are best suited to GPU and FPGA acceleration

FPGAs were able to accelerate MPEG decoding by twenty times over general purpose CPUs.

If you liked this article, please give it a quick review on ycombinator or StumbleUpon. Thanks

Subscribe on Google News