Boyar, Joan4; Favrholdt, Lene Monrad4; Larsen, Kim Skak4
1 Faculty of Science, SDU2 Department of Mathematics and Computer Science (IMADA), Faculty of Science, SDU3 Computer Science, Department of Mathematics and Computer Science (IMADA), Faculty of Science, SDU4 Department of Mathematics and Computer Science (IMADA), Faculty of Science, SDU
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 apply it to the paging problem and 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. According to the relative worst order ratio, no deterministic marking algorithm can be significantly better than LRU, but the randomized algorithm MARK is better than LRU. Finally, look-ahead is shown to be a significant advantage, in contrast to the competitive ratio, which does not reflect that look-ahead can be helpful.
Journal of Computer and System Sciences, 2007, Vol 73, Issue 5, p. 818-843