By CodeJustin
via catonmat.net
Published: Jul 13 2009 / 14:17
This is a happy and sad moment at the same time - I have finally reached the last two lectures of MIT’s undergraduate algorithms course. These last two lectures are on a fairly new area of algorithm research called “cache oblivious algorithms.”
Cache-oblivious algorithms take into account something that has been ignored in all the lectures so far, particularly, the multilevel memory hierarchy of modern computers. Retrieving items from various levels of memory and cache make up a dominant factor of running time, so for speed it is crucial to minimize these costs. The main idea of cache-oblivious algorithms is to achieve optimal use of caches on all levels of a memory hierarchy without knowledge of their size.
Add your comment
Voters For This Link (13)
-
CodeJustin -
rick -
mswatcher -
rsmaniak -
davneter -
pkrumins -
id21 -
Joey.Rodman
-
tenshi
-
polterguy -
webmascon
-
LILkillaBEE
-
jweslley
