Complexity of Online Algorithms - CSIS
Complexity of Online Algorithms - CSIS
Complexity of Online Algorithms - CSIS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Paging against an oblivious adversary<br />
Consider an online deterministic paging algorithm A<br />
• Let p be a probability distribution for choosing a request<br />
sequence<br />
• i.e. a distribution for choosing i (which may depend on<br />
i1 , i2 , ... , i-1 )<br />
• Both A’s cost and the optimal cost are now random<br />
variables.<br />
• Define A’s competitiveness coefficient under p , denoted<br />
C A<br />
p<br />
, to be the smallest C such that<br />
E[f R ()] – C * E[f OPT ()]
Change language