We all know how to use “Big O” notation to show how CPU instructions run increase as the size of the dataset increases. E.g. a quick sort is O(n log n).
However for the last few years, instructions that don’t access any data outside of the level 1 cache have been close to free compared to instructions that hit main memory.
So is there some notation that is as clear as the “Big O” notation to help capture the sort of effect?