Ask HN: Is the Processor vs. Memory speed gap in the future shrinking or not?
I'm thinking about data structures, which are currently outperformed by smarter cache-line friendly algorithms as for instance balanced mutable binary search trees vs smart trie or B-tree implementations. These index structures are of course meant as an example for the wide range of algorithms, which have to take cache-lines into account nowadays.
Do you think these "old" algorithms are getting some kind of renaissance in the future?