Optimal Caching – Greedy Algorithm
Optimal Caching is a technique that reduces the number of cache misses compared to any other method of cache management.
Interval Scheduling Greedy Algorithm
The concept behind Interval Scheduling Greedy Algorithm is that we have a set of jobs (tasks) that need to be scheduled on a machine, and each job j has a start time Sj and a finish time Fj. We can’t schedule two jobs at the same time if they overlap. Our objective is to fill […]