DEV Community

Cover image for Optimal Caching – Greedy Algorithm
He Codes IT
He Codes IT

Posted on

Optimal Caching – Greedy Algorithm

Optimal Caching is a technique that reduces the number of cache misses compared to any other method of cache management. There is a good course on Coursera about Greedy Algorithms Check it out HERE.

Cache
The cache is a small and fast memory. Cache process the sequence of “page requests”. Page requests are if a client wants to access something in memory and it is in big slow memory, and if it is not in small fast memory then you have to bring it in. A cache miss is when you request some data from the cache but it is not stored there.

To read more visit https://hecodesit.com/optimal-caching-greedy-algorithm/

Top comments (0)