Complexity of Online Algorithms - CSIS

More documents

Recommendations

Info

Paging against an oblivious adversary Compare the results of the previous two theorems i.e. • C R obl >= H k for any randomized algorithm R and • C M obl = 2*H k for the M(arker) algorithm with that of the lower bound result for deterministic algorithms: • C A >= k for any deterministic algorithm A How do you interpret the results?
Relating the Adversaries How do randomized online paging algorithms compete against adaptive adversaries? Theorem (without proof): [applicable for a general class of request-answer problems including paging] • If there is a randomized algorithm that is -competitive against every adaptive offline adversary, then there exists an -competitive deterministic algorithm. Implication (for paging): • There is no randomized online algorithm for paging with a competitiveness coefficient smaller than k.
Page 1 and 2: CS/IS C442 Advanced Algorithms & Co
Page 3 and 4: Paging Problem Consider a 2 level
Page 5 and 6: Paging Algorithms Typical performa
Page 7 and 8: Paging Algorithm - Miss Rates Assu
Page 9 and 10: Paging Algorithm - Competitive Anal
Page 15 and 16: Adversary Models There are differe
Page 17 and 18: Competitiveness of Randomized Algor
Page 19 and 20: Competitiveness of Randomized Algor
Page 21 and 22: Paging against an oblivious adversa
Page 27 and 28: Online Paging - Marker Algorithm T
Page 29: Online Paging - Marker Algorithm T

Complexity of Online Algorithms - CSIS

Create successful ePaper yourself

Delete template?

Save as template?