Complexity of Online Algorithms - CSIS

More documents

Recommendations

Info

Online Algorithms Online vs. Offline algorithms • Offline algorithms receive all their inputs at one time. • Online algorithms receive and process their inputs in partial amounts e.g. Sorting • Quick Sort is an offline sorting algorithm while Insertion Sort is an online sorting algorithm • Why?
Paging Problem Consider a 2 level memory hierarchy in a computer system • a fast – therefore expensive – therefore small – memory M 0 • a slow – therefore inexpensive – therefore large – memory M 1 Assume that each level is divided into units of exchange known as pages • Let M 0 have k pages and M 1 have at least k+1 pages When a page is to be used by the processor, it is brought in from M 1 to M 0 if it is not already available • If no free slot is available in M 0 then one of the existing pages have to be replaced
Page 1: CS/IS C442 Advanced Algorithms & Co
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 and 30: Online Paging - Marker Algorithm T
Page 31 and 32: Relating the Adversaries How do ra

Complexity of Online Algorithms - CSIS

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?