Talk:Cache-oblivious algorithm: Difference between revisions

Content deleted Content added
typo
Cewbot (talk | contribs)
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computer science}}.
 
(6 intermediate revisions by 5 users not shown)
Line 1:
{{WikiProject banner shell|class=Start|
{{WikiProject Computer science|importance=low}}
}}
"This can be implemented in practice with the Least Recently Used policy, which is shown to be within a factor of 2 of the offline optimal replacement strategy."
 
Line 12 ⟶ 15:
 
:[[User:Stevenj|—Steven G. Johnson]] 16:10, 8 June 2007 (UTC)
 
== cache-oblivious unrolled linked lists ==
 
"it is possible to design a variant of unrolled linked lists which is cache-oblivious" is false. The closest thing is the packed-memory array, but its append is slow. Normal and unrolled linked lists have constant time append. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/190.135.57.152|190.135.57.152]] ([[User talk:190.135.57.152|talk]]) 00:10, 27 May 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->