Cache: Difference between revisions
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
=Overview= | =Overview= | ||
A cache is a small fast memory. As long as elements fit in the cache, the access is fast, but when the cache reaches its capacity, decisions should be taken as to what element or elements should be evicted to make more room. The [[The_Optimal_Caching_Problem#Overview|optimal caching greedy algorithm]] is an example of how this problem can be solved. | A cache is a small fast memory. As long as elements fit in the cache, the access is fast, but when the cache reaches its capacity, decisions should be taken as to what element or elements should be evicted to make more room. The [[The_Optimal_Caching_Problem#Overview|optimal caching greedy algorithm]] is an example of how this problem can be solved. | ||
=Organizatorium= | |||
* https://github.com/jwasham/coding-interview-university#caches | |||
Revision as of 20:25, 3 November 2021
Internal
Overview
A cache is a small fast memory. As long as elements fit in the cache, the access is fast, but when the cache reaches its capacity, decisions should be taken as to what element or elements should be evicted to make more room. The optimal caching greedy algorithm is an example of how this problem can be solved.