2 ms·
The authors of FFTW published a paper about their computational method, an early example of "cache-oblivious" array traversal order. (In this method, uses of el
by ncmncm 8y ago
The authors of FFTW published a paper about their computational method, an early example of "cache-oblivious" array traversal order. (In this method, uses of elements noodle around in small areas, getting a free locality boost. Typically they use a Hilbert or Peano path.) They refused to cite Todd Veldhuizen, who had done it (with plenty of publicity) a year before. They refused to discuss why, but it is apparent that it was because Veldhuizen had published in Dr. Dobb's Journal of Computer Orthodontia ("Running light without overbyte").