Cache

From NovaOrdis Knowledge Base
Revision as of 02:04, 20 October 2021 by Ovidiu (talk | contribs) (Created page with "=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 ta...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.