it's sad to see these "moved from X language to Y language and it became faster!" every-time. If the CPU is the hugest bottleneck, the best answer is not to op

it's sad to see these "moved from X language to Y language and it became faster!" every-time. If the CPU is the hugest bottleneck, the best answer is not to optimize the algorithm by going to a lower level language, but rather to invest in a different architecture like GPGPU or FPGA. For example, this paper shows a significant speed-up for PIP( Polygon in Point) algorithm, going from 15hs (CPU) to a mere 11sec (GPU) in task load-time. https://pdfs.semanticscholar.org/1e51/e3c681e1afc908a41ac253b7ef72f3285d1f.pdf https://pdfs.semanticscholar.org/1e51/e3c681e1afc908a41ac253...