Abstract
In this paper we give a finer separation of several known paging algorithms. This is accomplished using a new technique that we call relative interval analysis. The technique compares the fault rate of two paging algorithms across the entire range of inputs of a given size rather than in the worst case alone. Using this technique we characterize the relative performance of LRU and LRU-2, as well as LRU and FWF, among others. We also show that lookahead is beneficial for a paging algorithm, a fact that is well known in practice but it was, until recently, not verified by theory.
This work was supported by grants from the Software Telecommunications Group at the University of Waterloo, NSERC of Canada and the Canada Research Chairs Program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albers, S.: On the influence of lookahead in competitive paging algorithms. Algorithmica 18(3), 283–305 (1997)
Albers, S., Favrholdt, L.M., Giel, O.: On paging with locality of reference. Journal of Computer and System Sciences 70 (2005)
Angelopoulos, S., Dorrigiv, R., López-Ortiz, A.: On the separation and equivalence of paging strategies. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 229–237 (2007)
Becchetti, L.: Modeling locality: A probabilistic analysis of LRU and FWF. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 98–109. Springer, Heidelberg (2004)
Ben-David, S., Borodin, A.: A new measure for the study of on-line algorithms. Algorithmica 11, 73–91 (1994)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Borodin, A., Irani, S., Raghavan, P., Schieber, B.: Competitive paging with locality of reference. Journal of Computer and System Sciences 50, 244–258 (1995)
Boyar, J., Ehmsen, M.R., Larsen, K.S.: Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 95–107. Springer, Heidelberg (2007)
Boyar, J., Favrholdt, L.M., Larsen, K.S.: The Relative Worst Order Ratio Applied to Paging. In: ACM-SIAM SODA 2005, pp. 718–727 (2005)
Boyar, J., Favrholdt, L.M.: The relative worst order ratio for on-line algorithms. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653, Springer, Heidelberg (2003)
Boyar, J., Medvedev, P.: The relative worst order ratio applied to seat reservation. In: SWAT: Scandinavian Workshop on Algorithm Theory (2004)
Dorrigiv, R., López-Ortiz, A.: A survey of performance measures for on-line algorithms. SIGACT News (ACM Special Interest Group on Automata and Computability Theory) 36(3), 67–81 (2005)
Kenyon, C.: Best-fit bin-packing with random order. In: ACM-SIAM SODA 1996, pp. 359–364 (1996)
Koutsoupias, E., Papadimitriou, C.: Beyond competitive analysis. SIAM J. Comput. 30, 300–317 (2000)
Megiddo, N., Modha, D.S.: ARC: A self-tuning, low overhead replacement cache. In: Proceedings of the 2nd USENIX Conference on File and Storage Technologies (FAST 2003), pp. 115–130 (2003)
O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K page replacement algorithm for database disk buffering. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 297–306 (1993)
Panagiotou, K., Souza, A.: On adequate performance measures for paging. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC 2006), pp. 487–496 (2006)
Silberschatz, A., Galvin, P.B., Gagne, G.: Operating System Concepts. John Wiley & Sons, Chichester (2002)
Sites, R.L., Agarwal, A.: Multiprocessor cache analysis using ATUM. In: Proceedings of the fifteenth Annual International Symposium on Computer Architecture (ISCA 1988), pp. 186–195 (1988)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)
Youn, N.E.: The k-server dual and loose competitiveness for paging. Algorithmica 11(6), 525–541 (1994)
Young, N.E.: Bounding the diffuse adversary. In: Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 420–425 (1998)
Young, N.E.: On-line paging against adversarially biased random inputs. Journal of Algorithms 37(1), 218–235 (2000)
Young, N.E.: On-line file caching. Algorithmica 33(3), 371–383 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dorrigiv, R., López-Ortiz, A., Munro, J.I. (2007). On the Relative Dominance of Paging Algorithms. In: Tokuyama, T. (eds) Algorithms and Computation. ISAAC 2007. Lecture Notes in Computer Science, vol 4835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77120-3_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-77120-3_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77118-0
Online ISBN: 978-3-540-77120-3
eBook Packages: Computer ScienceComputer Science (R0)