17 pointsby teleforce14 hours ago2 comments
  • rurban7 hours ago
    Of course cache misses dominate over search or eytzinger.

    Algorithmic courses are only for theoretical stone age computers.

    • mathisfun1232 hours ago
      You're wrong but for the right reasons: all of academic software pedagogy is about "abstractions" because academics do not work for a living (they teach). That's why whenever I hear anyone use the word abstraction I bucket them under roughly the same category (people who write software that does not matter). Think about it: if you can afford to not care about cache misses or latencies or memory hierarchies or any of the other physical details which are extremely specific (the opposite of abstract) then you are writing code that has no constraints. no scale, no externalities.
      • rurban36 minutes ago
        Fine and dandy, but 40x faster trumps all algorithmic theories. You need to teach and implement cache-oblivious algos.
    • 6 hours ago
      undefined
  • tnelsond47 hours ago
    Rambus goes VROOM Vroom.

    Would all of this still be applicable for string comparisons? Would I have to hash my strings first?