Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theor. Comput. Sci. 234(1–2), 203–218 (2000)
Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Syst. J. 5, 78–101 (1966)
Borodin, A., Linial, N., Saks, M.: An optimal online algorithm for metrical task systems. J. ACM 39, 745–763 (1992)
Chrobak, M., Larmore, L.L.: The Server Problem and On-line Games. DIMACS Series in Discrete Math. and Theoretical Comput. Science, vol. 7 (1992)
Demange, M., Paschos, V.T.: On-line vertex-covering. Theor. Comput. Sci. 332, 83–108 (2005)
Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM J. Comput. 34(5), 1129–1146 (2005)
Fiat, A., Ricklin, M.: Competitive algorithms for the weighted server problem. Theor. Comput. Sci. 130, 85–99 (1994)
Fiat, A., Karp, R., Luby, M., McGeoch, L.A., Sleator, D., Young, N.E.: Competitive paging algorithms. J. Algorithms 12, 685–699 (1991)
Irani, S.: Competitive analysis of paging. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms: The State of Art, pp. 52–73. Springer, New York (1998)
Karlin, A., Manasse, M., Rudolph, L., Sleator, D.: Competitive snoopy caching. Algorithmica 3, 79–119 (1988)
Manasse, M., McGeoch, L.A., Sleator, D.: Competitive algorithms for server problems. J. Algorithms 11, 208–230 (1990)
McGeoch, L., Sleator, D.: A strongly competitive randomized paging algorithm. Algorithmica 6(6), 816–825 (1991)
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)
Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28, 202–208 (1985)
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in Proc. Scandinavian Workshop on Algorithm Theory (SWAT 2006), pp. 124–135, 2006.
Research of R. van Stee supported by Alexander von Humboldt Foundation.
Rights and permissions
About this article
Cite this article
Epstein, L., van Stee, R. & Tamir, T. Paging with Request Sets. Theory Comput Syst 44, 67–81 (2009). https://doi.org/10.1007/s00224-007-9029-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-007-9029-2