Paging with Request Sets

  • Leah Epstein
  • Rob van Stee
  • Tami Tamir
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4059)


A generalized paging problem is considered. Each request is expressed as a set of u pages. In order to satisfy the request, at least one of these pages must be in the cache. Therefore, on a page fault, the algorithm must load into the cache at least one page out of the u pages given in the request. The problem arises in systems in which requests can be serviced by various utilities (e.g., a request for a data that lies in various web-pages) and a single utility can service many requests (e.g., a web-page containing various data). The server has the freedom to select the utility that will service the next request and hopefully additional requests in the future.

The case u = 1 is simply the classical paging problem, which is known to be polynomially solvable. We show that for any u > 1 the offline problem is NP-hard and hard to approximate if the cache size k is part of the input, but solvable in polynomial time for constant values of k. We consider mainly online algorithms, and design competitive algorithms for arbitrary values of k,u. We study in more detail the cases where u and k are small. We also give an algorithm which uses resource augmentation and which is asymptotically optimal for u = 2.


Competitive Ratio Online Algorithm Vertex Cover Cache Size Competitive Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theoretical Comp. Science 234(1-2), 203–218 (2000)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5, 78–101 (1966)CrossRefGoogle Scholar
  3. 3.
    Borodin, A., Linial, N., Saks, M.: An optimal online algorithm for metrical task systems. In: Proc. 19th ACM Symp. on Theory of Computing (1987)Google Scholar
  4. 4.
    Chrobak, M., Larmore, L.L.: The server problem and on-line games. DIMACS Series in Discrete Math. and Theoretical Comp. Science, vol. 7 (1992)Google Scholar
  5. 5.
    Demange, M., Paschos, V.T.: On-line vertex-covering. Theoretical Computer Science 332, 83–108 (2005)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. In: Proc. 35th ACM Symp. on Theory of Comp., pp. 595–601 (2003)Google Scholar
  7. 7.
    Fiat, A., Karp, R., Luby, M., McGeoch, L.A., Sleator, D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms 12, 685–699 (1991)MATHCrossRefGoogle Scholar
  8. 8.
    Fiat, A., Ricklin, M.: Competitive algorithms for the weighted server problem. Theoretical Computer Science 130, 85–99 (1994)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Irani, S.: Competitive analysis of paging. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms: The State of Art, pp. 52–73. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  10. 10.
    Karlin, A., Manasse, M., Rudolph, L., Sleator, D.: Competitive snoopy caching. Algorithmica 3, 79–119 (1988)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Manasse, M., McGeoch, L.A., Sleator, D.: Competitive algorithms for server problems. Journal of Algorithms 11, 208–230 (1990)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    McGeoch, L., Sleator, D.: A strongly competitive randomized paging algorithm. Algorithmica 6(6), 816–825 (1991)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proc. 29th ACM Symp. on Theory of Comp., pp. 475–484 (1997)Google Scholar
  14. 14.
    Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Leah Epstein
    • 1
  • Rob van Stee
    • 2
  • Tami Tamir
    • 3
  1. 1.Department of MathematicsUniversity of HaifaHaifaIsrael
  2. 2.Department of Computer ScienceUniversity of KarlsruheKarlsruheGermany
  3. 3.The Interdisciplinary CenterSchool of Computer ScienceHerzliyaIsrael

Personalised recommendations