The relative worst order ratio, a relatively new measure for the quality
of on-line algorithms, is extended and applied to the paging problem.
We obtain results significantly different from those obtained with the
First, we devise a new deterministic paging algorithm,
show that, according to the relative worst order ratio, it performs better
This is supported by experimental results, but contrasts with the
Furthermore, the relative worst order ratio (and practice) indicates that LRU
is better than FWF, though all deterministic marking algorithms have the same
Look-ahead is also shown to be a significant advantage with this
new measure, whereas the competitive ratio does not reflect that
look-ahead can be helpful.
Finally, as with the competitive ratio, no
can be significantly better than
LRU, but the randomized algorithm MARK is better than LRU.
- The Relative Worst Order Ratio Applied to Paging.
- Joan Boyar, Lene M. Favrholdt, and Kim S. Larsen.
Journal of Computer and System Sciences, 73(5): 818-843, 2007.
The publication is available from ScienceDirect (subscription may be required).
Other publications by the author.
Last modified: Sat Jun 1 09:29:15 CEST 2013
Kim Skak Larsen