Re:Memory and Native Code Performance
by comefrom30 on Monday July 01, 2013 @12:46AM
(#5968706)
Sometimes the problem size doesn't increase. Sometimes you maybe just need to do lots and lots and lots and lots of small matrix multiplications.
I am not going to deny that hardware matters, but it is important to know where it matters. Hardware matters in terms of constant factors. For sufficiently large problem sizes, hardware might give you a 10x improvement if you use it correctly -- but that is 10x no matter how large the problem size becomes. An algorithmic improvement will become increasingly beneficial as the problem size increases; that is why we speak of things like "crossing points," where an asymptotically faster algorithm begins to dominate. Even very poor use of hardware features (terrible locality of reference, etc.) will eventually be irrelevant for an asymptotically better algorithm; a large number of really good uses of the hardware is still slower than a small number of really bad uses.