Abstract
We study the online restricted caching problem, where each memory item can be placed in only a restricted subset of cache locations. We solve this problem through a more general online caching problem in which the cache is subject to matroid constraints. Our main result is an O( min {d,logr} ·logc)-competitive algorithm for the matroid caching problem, where r and c are the rank and circumference of the matroid, and d is the diameter of an auxiliary graph defined over it. In general, this result guarantees an O(log2 k)-competitiveness for any restricted cache of size k, independently of its structure. In addition, we study the special case of the (n,ℓ)-companion caching problem [8]. For companion caching we prove that our algorithm achieves an optimal competitive factor of O(logn + logℓ), improving on previous results of [18].
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
Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theoretical Computer Science 234, 203–218 (2000)
Adamaszek, A., Czumaj, A., Englert, M., Räcke, H.: An o(log k)-competitive algorithm for generalized caching. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1681–1689 (2012)
Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. SIAM Journal on Computing 39(2), 361–370 (2009)
Bansal, N., Buchbinder, N., Naor, J.: Towards the randomized k-server conjecture: A primal-dual approach. In: Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 40–55 (2010)
Bansal, N., Buchbinder, N., Naor, J.: A primal-dual randomized algorithm for weighted paging. J. ACM 59(4) (2012)
Bansal, N., Buchbinder, N., Naor, J.: Randomized competitive algorithms for generalized caching. SIAM J. Comput. 41(2), 391–414 (2012)
Belady, L.: A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal 5(2), 78–101 (1966)
Brehob, M., Enbody, R., Torng, E., Wagner, S.: On-line restricted caching. In: Proc. 12th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 374–383 (2001)
Brehob, M., Enbody, R., Wagner, S., Torng, E.: Optimal replacement is np-hard for nonstandard caches. IEEE Transactions on Computers 53(1), 73–76 (2004)
Buchbinder, N., Chen, S., Naor, J.: Competitive analysis via regularization. In: SODA, pp. 436–444 (2014)
Buchbinder, N., Chen, S., Naor, J., Shamir, O.: Unified algorithms for online learning and competitive analysis. In: COLT, pp. 5.1–5.18 (2012)
Buchbinder, N., Naor, J.: The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science 3(2-3), 93–263 (2009)
Cunningham, W.H.: Testing membership in matroid polyhedra. Journal of Combinatorial Theory, Series B 36(2), 161–188 (1984)
Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Combinatorial Structures and Their Applications, pp. 69–87 (1970)
Edmonds, J.: Matroids and the greedy algorithm. Mathematical Programming 1(1), 127–136 (1971)
Epstein, L., van Stee, R.: Calculating lower bounds for caching problems. Computing 80(3), 275–285 (2007)
Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms 12(4), 685–699 (1991)
Fiat, A., Mendel, M., Seiden, S.S.: Online companion caching. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 499–511. Springer, Heidelberg (2002)
Gupta, A., Talwar, K., Wieder, U.: Changing bases: Multistage optimization for matroids and matchings. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 563–575. Springer, Heidelberg (2014)
Harary, F., Welsh, D.: Matroids versus graphs. In: The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol. 110, pp. 155–170 (1969)
McGeoch, L.A., Sleator, D.D.: A strongly competitive randomized paging algorithm. Algorithmica 6(1-6), 816–825 (1991)
Peserico, E.: Online paging with arbitrary associativity. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 555–564 (2003)
Schrijver, A.: Combinatorial Optimization: polyhedra and efficiency. Springer (2003)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communication of the ACM 28(2), 202–208 (1985)
Vondrák, J., Chekuri, C., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. In: Proc. of the 43rd Annual ACM Symposium on Theory of Computing, pp. 783–792 (2011)
Whitney, H.: On the abstract properties of linear dependence. American Journal of Mathematics 57(3), 509–533 (1935)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchbinder, N., Chen, S., Naor, J.(. (2014). Competitive Algorithms for Restricted Caching and Matroid Caching. In: Schulz, A.S., Wagner, D. (eds) Algorithms - ESA 2014. ESA 2014. Lecture Notes in Computer Science, vol 8737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44777-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-662-44777-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44776-5
Online ISBN: 978-3-662-44777-2
eBook Packages: Computer ScienceComputer Science (R0)