Re:Memory and Native Code Performance
by srean on Monday July 01, 2013 @09:05AM
(#5970315)
You are both technically correct and at the same time do not have an idea of what you are talking about. The break even point for these algorithm is so huge that even at say Google scale it does not matter. Data access latency plays an overwhelmingly more important role.
[ Parent
| on HN ]
Re:Memory and Native Code Performance
by betterunix on Monday July 01, 2013 @11:30AM
(#5971272)
The break-even point for Strassen's algorithm is not unrealistic -- it is around the 1000x1000 range. You might be thinking of the best known algorithms:
https://en.wikipedia.org/wiki/Coppersmith-Winograd_algorithm
Strassen's algorithm is certainly used in practice.