3 ms·
(Assuming, we're not talking about distributed solutions) The fastest way would be to create an ASIC: hardware designed to run your algorithm specifically. So
by imaginenore 10y ago
(Assuming, we're not talking about distributed solutions)
The fastest way would be to create an ASIC: hardware designed to run your algorithm specifically.
Something simpler and a bit slower would be an FPGA.
Below that is a GPU implementation of your code, assuming it can be parallelized.
Below that is hand-crafted assembly by someone who is smarter than a good compiler.
Below that is hand-crafted C/C++ or Fortran code.
Here are benchmarks of various languages for various problems:
N-body: https://benchmarksgame.alioth.debian.org/u64q/performance.php?test=nbody https://benchmarksgame.alioth.debian.org/u64q/performance.ph...
Spectral-norm: http://benchmarksgame.alioth.debian.org/u64q/performance.php?test=spectralnorm http://benchmarksgame.alioth.debian.org/u64q/performance.php...
Digits of pi: http://benchmarksgame.alioth.debian.org/u64q/performance.php?test=pidigits http://benchmarksgame.alioth.debian.org/u64q/performance.php...
FASTA: http://benchmarksgame.alioth.debian.org/u64q/performance.php?test=fasta http://benchmarksgame.alioth.debian.org/u64q/performance.php...
- igouy 10y ago> Below that is hand-crafted C/C++ or Fortran code. Only with the qualifier "by someone who is smarter than a good compiler" and the qualifier "with unlimited time".