Cache-oblivious algorithms: Difference between revisions

From dankwiki
No edit summary
No edit summary
 
Line 1: Line 1:
Might it be possible to implement algorithms without concerning ourselves with the [[Architecture#Memory_Hierarchies|memory hierarchy]], as [[Cache-aware algorithms|cache-aware algorithms]] must?
Might it be possible to implement algorithms without concerning ourselves with the [[Architecture#Memory_Hierarchies|memory hierarchy]], as [[Cache-aware algorithms|cache-aware algorithms]] must?
==See also==
* Harold Prokop's 1999 MIT masters thesis, "[http://citeseer.ist.psu.edu/prokop99cacheobliviou.html Cache-oblivious Algorithms]".
* MIT 6.897 "Advanced Data Structures" notes on [http://courses.csail.mit.edu/6.897/spring03/scribe_notes/L17/lecture17.pdf Review of Cache-Oblivious Sorting].

Latest revision as of 09:31, 17 February 2010

Might it be possible to implement algorithms without concerning ourselves with the memory hierarchy, as cache-aware algorithms must?

See also