backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 14:23:03 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 842c4ab5dd

Browse Source
This commit is contained in:
github-actions
2023-04-21 16:16:37 +00:00
parent 32e090479d
commit 64c9693255
46 changed files with 332 additions and 256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
d3/db3/lru__cache_8cpp.html
View File

@@ -157,7 +157,7 @@ Functions</h2></td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>An implementation of <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU Cache</a>. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies). </p>
<h3><a class="anchor" id="autotoc_md95"></a>
<h3><a class="anchor" id="autotoc_md96"></a>
Logic</h3>
<ul>
<li>Discards the least recently used items first.</li>
@@ -165,7 +165,7 @@ Logic</h3>
<li>General implementations of this technique require keeping "age bits" for cache-lines and track the "Least Recently Used" cache-line based on age-bits.</li>
<li>In such an implementation, every time a cache-line is used, the age of all other cache-lines changes</li>
</ul>
<h3><a class="anchor" id="autotoc_md96"></a>
<h3><a class="anchor" id="autotoc_md97"></a>
Algorithm explanation</h3>
<p>For a cache of page frame x:</p><ul>
<li>Check if the page is present in cache.</li>
@@ -177,7 +177,7 @@ Algorithm explanation</h3>
</li>
</ul>
<p>Every time a requested page is not found in cache, that is a miss or page fault, and if the page is present in cache, then its a hit.</p>
<h2><a class="anchor" id="autotoc_md97"></a>
<h2><a class="anchor" id="autotoc_md98"></a>
Data Structure used</h2>
<ul>
<li>In the algorithm below we used two different data structure, one is linked list and other one is a hash map</li>