The relative worst-order ratio applied to paging

The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition and apply it to the paging problem. Work in progress by other researchers shows that the measure gives interesting results and new separations for bin coloring and scheduling problems as well. Using the relative worst order ratio, we obtain the following results: We devise a new deterministic paging algorithm, Retrospective-LRU, and show that it performs better than LRU. This is supported by experimental results, but contrasts with the competitive ratio. All deterministic marking algorithms have the same competitive ratio, but here we find that LRU is better than FWF. Furthermore, LRU is better than Permπ, which also has the same competitive ratio as LRU. No deterministic marking algorithm can be significantly better than LRU, but the randomized algorithm MARK is better than LRU. Finally, lookahead is show...

• Type: Journal
• Year: 2007
• Where: JCSS
• Authors: Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
• Keywords: Competitive Ratio, JCSS 2007, Relative Worst Order, Worst Order Ratio