The Optimal Caching Problem: Difference between revisions
Jump to navigation
Jump to search
| Line 4: | Line 4: | ||
* [[Algorithms#Greedy_Algorithms|Algorithms]] | * [[Algorithms#Greedy_Algorithms|Algorithms]] | ||
=Overview= | =Overview= | ||
The optimal caching problem can be solved with a [[Algorithms#Greedy_Algorithms|greedy algorithm]]. | The optimal caching problem can be solved with a [[Algorithms#Greedy_Algorithms|greedy algorithm]]. A [[Cache|cache]] is a small fast memory. | ||
Revision as of 02:02, 20 October 2021
External
Internal
Overview
The optimal caching problem can be solved with a greedy algorithm. A cache is a small fast memory.