This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 1 2/11/10 COT 6936 1 COT 6936: Topics in Algorithms Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 email@example.com http://www.cs.fiu.edu/~giri/teach/COT6936_S10.html https://online.cis.fiu.edu/portal/course/view.php?id=427 Online Problems Should I buy a car/skis/camping gear or rent them when needed? Should I buy Google stocks today or sell them or hold on to them? Should I work on my homework in Algorithms or my homework in OS or on my research? Decisions have to be made based on past and current request/task 2/11/10 COT 6936 2 Paging Problem Given 2-level storage system Limited Faster Memory ( k pages) CACHE Unlimited Slower Memory Input : Sequence of page requests Assumption : Lazy response (Demand Paging) If page is in CACHE, no changes to contents If page is not in CACHE, make place for it in CACHE by replacing an existing page Need : A page replacement algorithm 2/11/10 COT 6936 3 Infinite, Online 2 Well-known Page Replacement Algorithms...
View Full Document
- Spring '12