Download presentation

Presentation is loading. Please wait.

Published byCody Dickerson Modified over 3 years ago

1
Princeton University COS 423 Theory of Algorithms Spring 2001 Kevin Wayne Competitive Analysis

2
2 Beyond Worst Case Analysis Worst-case analysis. n Analyze running time as function of worst input of a given size. Average case analysis. n Analyze average running time over some distribution of inputs. n Ex: quicksort. Amortized analysis. n Worst-case bound on sequence of operations. n Ex: splay trees, union-find. Competitive analysis. n Make quantitative statements about online algorithms. n Ex: paging, load balancing.

3
3 Online Algorithm and Competitive Analysis Paging problem: Given two-level store consisting of fast memory (cache) that can hold k pages, and slow memory that can store infinitely many pages. n Sequence of page requests p: – if page p already in cache, no cost incurred – otherwise, eject some other page q from cache and replace with p, and pay unit cost for page fault. n If p not in cache, which page q should you evict? n Most fundamental and practically important online problem in CS.

4
4 Online Algorithm and Competitive Analysis Competitive analysis. (Sleator-Tarjan) n Algorithm A is -competitive if there exists some constant b such that for every sequence of inputs : where OPT is optimal offline algorithm. n OPT = MIN: evict page whose next access is furthest away. n A = LRU: evict page whose most recent access was earliest Traditional analysis completely uninformative. We show LRU is k-competitive. n A = LIFO: evict page brought in most recently. LIFO can have arbitrarily bad competitive ratio. n Fact: no online paging algorithm is better than k-competitive.

5
5 Online Algorithm and Competitive Analysis Theorem. LRU is k-competitive. Proof: Let be a subsequence of on which LRU faults exactly k times, and does not contain fist access in . Let p denote page requested just before . n Case 1: LRU faults in sequence on p. – requests at least k+1 different pages MIN faults at least once n Case 2: LRU faults on some page, say q, at least twice in . – requests at least k+1 different pages MIN faults at least once

6
6 Online Algorithm and Competitive Analysis Theorem. LRU is k-competitive. Proof: Let be a subsequence of on which LRU faults exactly k times, and does not contain fist access in . Let p denote page requested just before . n Case 3: LRU does not fault on p, nor on any page more than once. – k different pages are accessed and faulted on, none of which is p – p is in MIN's cache at start of MIN faults at least once 00 11 22... 11 pp :: LRU faults k times MIN faults 1 times LRU faults k times

Similar presentations

OK

Minimizing Cache Usage in Paging Alejandro Salinger University of Waterloo Joint work with Alex López-Ortiz.

Minimizing Cache Usage in Paging Alejandro Salinger University of Waterloo Joint work with Alex López-Ortiz.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on human body systems Ppt on hydraulic gear pump Ppt on digital television technology Ppt on hindu religion pictures One act play ppt on website Free ppt on parts of a flower Ppt on the periodic table of elements Ppt on hr practices of wipro Ppt on chapter 12 electricity Ppt on foreign exchange market in india