>>Rule 3. Fancy algorithms are slow when n is small, and n is usually small. Fancy algorithms have big constants. Until you know that n is frequently going to be big, don’t get fancy.
https://en.m.wikipedia.org/wiki/Hindley%E2%80%93Milner_type_...
>>Rule 3. Fancy algorithms are slow when n is small, and n is usually small. Fancy algorithms have big constants. Until you know that n is frequently going to be big, don’t get fancy.
https://en.m.wikipedia.org/wiki/Hindley%E2%80%93Milner_type_...
https://www.amd.com/en/press-releases/2022-03-21-3rd-gen-amd...
Is that a theoretical possibility based on the fact that Linux can run in a memory footprint < 768MB, or has someone actually demonstrated it? Can you boot one of these processors without any RAM installed?
Any modern CPU needs RAM, specially to get things to cache, I don't think there's any way around it.
What I was trying to say is that having a large L3 means that it never has to wait for RAM access, and that should be fast.
https://www.amd.com/en/press-releases/2022-03-21-3rd-gen-amd...