A primal-dual randomized algorithm for weighted paging

Journal of the ACM

Volumn 59, Issue 4, 2012, Pages

  Bansal, Nikhil ^a   Buchbinder, Niv ^b   Naor, Joseph Seffi ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Online algorithms; Primal dual; Randomization; Weighted paging

Indexed keywords

COMPETITIVE ALGORITHMS; FRACTIONAL SOLUTIONS; ON-LINE ALGORITHMS; ONLINE PRIMAL DUALS; PRIMAL-DUAL; RANDOMIZATION; RANDOMIZED ALGORITHMS; WEIGHTED PAGING;

PROBABILITY DISTRIBUTIONS;

ALGORITHMS;

EID: 84878619050     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2339123.2339126     Document Type: Article

References (29)

1. ACHLIOPTAS, D., CHROBAK, M., AND NOGA, J. 2000. Competitive analysis of randomized paging algorithms. Theoret. Computer Science 234, 1-2, 203-218.
2. ADAMASZEK, A., CZUMAJ, A., ENGLERT, M., AND RÄCKE, H. 2012. An O(log k)-competitive algorithm for generalized caching. In SODA. 1681-1689.
3. ALBERS, S. 2003. Online algorithms: A survey. Math. Prog. 97, 3-26.
4. BANSAL, N., BUCHBINDER, N., MADRY, A., AND NAOR, J. 2011. A polylogarithmic-competitive algorithm for the k-server problem. In Proceedings of the Symposium on Foundations of Computer Science. 267-276.
5. BANSAL, N., BUCHBINDER, N., AND NAOR, J. S. 2008. Randomized competitive algorithms for generalized caching. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing. 235-244.
6. BAR-NOY, A., BAR-YEHUDA, R., FREUND, A., NAOR, J. S., AND SCHIEBER, B. 2001. A unified approach to approximating resource allocation and scheduling. J. ACM 48, 5, 1069-1090.
7. BARTAL, Y., BLUM, A., BURCH, C., AND TOMKINS, A. 1997. A polylog(n)-competitive algorithm for metrical task systems. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing. 711-719.
8. BLUM, A., FURST, M., AND TOMKINS, A. 1996. What to do with your free time: Algorithms for infrequent requests and randomized weighted caching. Manuscript. (www.cs.cmu.edu)
9. BORODIN, A. AND EL-YANIV, R. 1998. Online computation and competitive analysis. Cambridge University Press.
10. BORODIN, A., LINIAL, N., AND SAKS, M. E. 1992. An optimal on-line algorithm for metrical task system. J. ACM 39, 4, 745-763.
11. BUCHBINDER, N., JAIN, K., AND NAOR, J. S. 2007. Online primal-dual algorithms for maximizing adauctions revenue. In Proceedings of the 15th Annual European Symposium. 253-264.
12. BUCHBINDER, N. AND NAOR, J. 2005. Online primal-dual algorithms for covering and packing problems. In Proceedings of the 13th Annual European Symposium on Algorithms. 689-701.
13. BUCHBINDER, N. AND NAOR, J. 2006. Fair online load balancing. In Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architectures. 291-298.
14. BUCHBINDER, N. AND NAOR, J. 2009. The design of competitive online algorithms via a primal-dual approach. Found. Trends Theoret. Comput. Sci. 3, 2-3, 93-263.
15. CHROBAK, M., KARLOFF, H., PAYNE, T., AND VISHWANATHAN, S. 1991. New results on server problems. SIAM J. Disc. Math 4, 2, 172-181.
16. CHROBAK, M. AND LARMORE, L. L. 1991. An optimal on-line algorithm for k-servers on trees. SIAM J. Comput. 20, 1, 144-148.
17. COHEN, E. AND KAPLAN, H. 1999. LP-based analysis of greedy-dual-size. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. 879-880.
18. COTÉ, A.,MEYERSON, A., AND POPLAWSKI, L. 2008. Randomized k-server on hierarchical binary trees. In STOC'08: Proceedings of the 40th Annual ACM Symposium on Theory of Computing. 227-234.
19. FIAT, A., KARP, R. M., LUBY, M.,MCGEOCH, L. A., SLEATOR, D. D., AND YOUNG, N. E. 1991. Competitive paging algorithms. J. Algorithms 1, 4, 685-699.
20. FIAT, A. AND MENDEL, M. 2003. Better algorithms for unfair metrical task systems and applications. SIAM J. Comput. 32, 6, 1403-1422.
21. FIAT, A., RABANI, Y., AND RAVID, Y. 1994. Competitive k-server algorithms. J. Comput. Syst. Sci. 48, 3, 410-428.
22. IRANI, S. 1997. Page replacement with multi-size pages and applications to web caching. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing. 701-710.
23. IRANI, S. 2002. Randomized weighted caching with two page weights. Algorithmica 32, 4, 624-640.
24. KOUTSOUPIAS, E. AND PAPADIMITRIOU, C. H. 1995. On the k-server conjecture. J. ACM 42, 5, 971-983.
25. MANASSE, M. S.,MCGEOCH, L. A., AND SLEATOR, D. D. 1990. Competitive algorithms for server problems. J. Algorithms 11, 2, 208-230.
26. MCGEOCH, L. A. AND SLEATOR, D. D. 1991. A strongly competitive randomized paging algorithm. Algorithmica 6, 6, 816-825.
27. SLEATOR, D. D. AND TARJAN, R. E. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2, 202-208.
28. YOUNG, N. 1991. On-line caching as cache size varies. In SODA'91: Proceedings of the 23rd Annual ACMSIAM Symposium on Discrete Adlgorithms. 241-250.
29. YOUNG, N. E. 1994. The k-server dual and loose competitiveness for paging. Algorithmica 11, 6, 525-541.