https://nick-black.com/dankwiki/index.php?title=Cache-oblivious_algorithms&feed=atom&action=history
Cache-oblivious algorithms - revision history
2024-03-29T09:03:53Z
Revision history for this page on the wiki
MediaWiki 1.41.0
https://nick-black.com/dankwiki/index.php?title=Cache-oblivious_algorithms&diff=2379&oldid=prev
Dank at 13:31, 17 February 2010
2010-02-17T13:31:47Z
<p></p>
<table style="background-color: #fff; color: #202122;" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr class="diff-title" lang="en">
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 13:31, 17 February 2010</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1">Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>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?</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>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?</div></td></tr>
<tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"></ins></div></td></tr>
<tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">==See also==</ins></div></td></tr>
<tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* Harold Prokop's 1999 MIT masters thesis, "[http://citeseer.ist.psu.edu/prokop99cacheobliviou.html Cache-oblivious Algorithms]".</ins></div></td></tr>
<tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* 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].</ins></div></td></tr>
</table>
Dank
https://nick-black.com/dankwiki/index.php?title=Cache-oblivious_algorithms&diff=1070&oldid=prev
Dank at 04:44, 25 September 2009
2009-09-25T04:44:39Z
<p></p>
<table style="background-color: #fff; color: #202122;" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr class="diff-title" lang="en">
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 04:44, 25 September 2009</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1">Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>Might it be possible to implement algorithms without concerning ourselves with the [[Architecture#<del style="font-weight: bold; text-decoration: none;">Memory_Hierarchy</del>|memory hierarchy]], as [[Cache-aware algorithms|cache-aware algorithms]] must?</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>Might it be possible to implement algorithms without concerning ourselves with the [[Architecture#<ins style="font-weight: bold; text-decoration: none;">Memory_Hierarchies</ins>|memory hierarchy]], as [[Cache-aware algorithms|cache-aware algorithms]] must?</div></td></tr>
<!-- diff cache key wikidb:diff:1.41:old-1069:rev-1070:php=table -->
</table>
Dank
https://nick-black.com/dankwiki/index.php?title=Cache-oblivious_algorithms&diff=1069&oldid=prev
Dank: Created page with 'Might it be possible to implement algorithms without concerning ourselves with the memory hierarchy, as [[Cache-aware algorithms|cache-aware alg...'
2009-09-25T04:44:19Z
<p>Created page with 'Might it be possible to implement algorithms without concerning ourselves with the <a href="/dankwiki/index.php/Architecture#Memory_Hierarchy" title="Architecture">memory hierarchy</a>, as [[Cache-aware algorithms|cache-aware alg...'</p>
<p><b>New page</b></p><div>Might it be possible to implement algorithms without concerning ourselves with the [[Architecture#Memory_Hierarchy|memory hierarchy]], as [[Cache-aware algorithms|cache-aware algorithms]] must?</div>
Dank