By Jochen Voss, on
I started reading Ulrich Drepper's excellent series
Programmer should know about memory. It is published by
Linux Weekly News in weekly installments.
Until now, the following parts appeared:
The author shows, for example, how the naive matrix-matrix multiplication
for (i = 0; i < N; ++i) for (j = 0; j < N; ++j) for (k = 0; k < N; ++k) res[i][j] += A[i][k] * B[k][j];
can be improved to run 10 times faster for big matrices!
This is an excerpt from Jochen's blog.
Newer entry: Spam statistics
Older entry: Random walk bridges
Copyright © 2007, Jochen Voss. All content on this website (including text, pictures, and any other original works), unless otherwise noted, is licensed under a Creative Commons Attribution-Share Alike 3.0 License.