Jochen's Sliding Picture Puzzle. A delightful game of pickled geckos, dazzling staircases, colourful flowers, hatted horsemen, blinding rides, strange patterns and sliding tiles, pains­tak­ingly arranged for your personal en­ter­tain­ment by Jochen Voss. … read more

Profile of the Boot Process of a Debian System. Profile of the Boot Process of a Debian System, generated using a custom Python script. … read more

XIsing. Homepage of the XIsing program. … read more

What every Programmer should know about memory

By , on [atom feed]

I started reading Ulrich Drepper's excellent series What every 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.