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.
Competitiveness <strong>of</strong> Randomized <strong>Algorithms</strong><br />
A randomized online paging algorithm R would make a<br />
– possibly random – choice <strong>of</strong> which <strong>of</strong> the k items in the<br />
cache it will evict:<br />
• Given a sequence <strong>of</strong> requests the number <strong>of</strong> misses is<br />
now a random variable, say, f R ()<br />
• Then R is C-competitive against the oblivious<br />
adversary if for every sequence <strong>of</strong> requests<br />
E[f R ()] – C * f OPT ()
Change language