Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2012:journals:jeanpaul:chapterfour_sectioniii [2012/02/27 03:21] – [Designing the Algorithm] mugabej
+++ courses:cs211:winter2012:journals:jeanpaul:chapterfour_sectioniii [2012/02/27 03:25] (current) – [Designing the Algorithm] mugabej
@@ Line 39: / Line 39: @@
     * -->Then there's a reduced schedule S' that makes the same eviction decisions as S<sub>FF</sub>  through the first j+1 items, and incurs no more misses than S does.
     * S<sub>FF</sub>  incurs no more misses than any other schedule S* and hence is optimal
->>>>>>>>>Proof: Course book, page 135-36
+-->-->-->Proof: Course book, page 135-36
+\\
+\\
+  * The caching algorithm can be extended to deal with eviction decisions without knowing the future
+  * Caching algorithms under this requirement are variants of the //Least-Recently-Used(LRU) Principle which proposes eviction on an item from the cache that was referenced //longest ago//.\\
+\\
+I give this section a 7/10.